./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_product12.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4d7925e6725ebc9ccc1628dac3a92336bad7d7149419f1b3b2e679ed4e3055d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:37:10,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:37:10,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:37:10,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:37:10,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:37:10,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:37:10,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:37:10,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:37:10,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:37:10,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:37:10,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:37:10,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:37:10,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:37:10,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:37:10,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:37:10,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:37:10,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:37:10,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:37:10,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:37:10,824 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/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 -> 4d7925e6725ebc9ccc1628dac3a92336bad7d7149419f1b3b2e679ed4e3055d5 [2025-03-08 05:37:11,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:37:11,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:37:11,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:37:11,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:37:11,072 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:37:11,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product12.cil.c [2025-03-08 05:37:12,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d441c50/02c456bccdd348ce8ce155bc72af6464/FLAGbcb6d13ab [2025-03-08 05:37:12,567 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:37:12,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c [2025-03-08 05:37:12,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d441c50/02c456bccdd348ce8ce155bc72af6464/FLAGbcb6d13ab [2025-03-08 05:37:12,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d441c50/02c456bccdd348ce8ce155bc72af6464 [2025-03-08 05:37:12,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:37:12,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:37:12,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:37:12,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:37:12,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:37:12,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:37:12" (1/1) ... [2025-03-08 05:37:12,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ca4528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:12, skipping insertion in model container [2025-03-08 05:37:12,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:37:12" (1/1) ... [2025-03-08 05:37:12,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:37:12,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c[29763,29776] [2025-03-08 05:37:13,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:37:13,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:37:13,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [48] [2025-03-08 05:37:13,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [105] [2025-03-08 05:37:13,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [122] [2025-03-08 05:37:13,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [160] [2025-03-08 05:37:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [405] [2025-03-08 05:37:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [811] [2025-03-08 05:37:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1091] [2025-03-08 05:37:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1457] [2025-03-08 05:37:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1466] [2025-03-08 05:37:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1570] [2025-03-08 05:37:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2639] [2025-03-08 05:37:13,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c[29763,29776] [2025-03-08 05:37:13,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:37:13,227 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:37:13,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13 WrapperNode [2025-03-08 05:37:13,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:37:13,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:37:13,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:37:13,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:37:13,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,293 INFO L138 Inliner]: procedures = 123, calls = 177, calls flagged for inlining = 51, calls inlined = 41, statements flattened = 837 [2025-03-08 05:37:13,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:37:13,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:37:13,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:37:13,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:37:13,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,327 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-03-08 05:37:13,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:37:13,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:37:13,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:37:13,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:37:13,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (1/1) ... [2025-03-08 05:37:13,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:37:13,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:13,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:37:13,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:37:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:37:13,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:37:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:37:13,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:37:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:37:13,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:37:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:37:13,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:37:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:37:13,405 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:37:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:37:13,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:37:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:37:13,406 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:37:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:37:13,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:37:13,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:37:13,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:37:13,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:37:13,407 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:37:13,407 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:37:13,407 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:37:13,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:37:13,407 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:37:13,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:37:13,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:37:13,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:37:13,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:37:13,787 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2497-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~41#1; [2025-03-08 05:37:13,787 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L392-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~7#1; [2025-03-08 05:37:13,787 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2616-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-08 05:37:13,787 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2181-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~36#1; [2025-03-08 05:37:13,810 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: #res := ~retValue_acc~11; [2025-03-08 05:37:13,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2273: #res#1 := ~retValue_acc~38#1; [2025-03-08 05:37:13,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-08 05:37:13,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567-1: createEmail_#res#1 := createEmail_~retValue_acc~26#1; [2025-03-08 05:37:13,927 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L644: #res := ~retValue_acc~14; [2025-03-08 05:37:14,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L349-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~4#1; [2025-03-08 05:37:14,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L358-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~5#1; [2025-03-08 05:37:14,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L367-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~6#1; [2025-03-08 05:37:14,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-08 05:37:14,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2336-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-08 05:37:14,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L157-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-03-08 05:37:14,167 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: #res := ~retValue_acc~15; [2025-03-08 05:37:14,235 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-08 05:37:14,235 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:37:14,249 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:37:14,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:37:14,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:37:14 BoogieIcfgContainer [2025-03-08 05:37:14,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:37:14,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:37:14,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:37:14,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:37:14,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:37:12" (1/3) ... [2025-03-08 05:37:14,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1bdc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:37:14, skipping insertion in model container [2025-03-08 05:37:14,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:13" (2/3) ... [2025-03-08 05:37:14,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1bdc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:37:14, skipping insertion in model container [2025-03-08 05:37:14,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:37:14" (3/3) ... [2025-03-08 05:37:14,260 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_product12.cil.c [2025-03-08 05:37:14,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:37:14,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_product12.cil.c that has 16 procedures, 260 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:37:14,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:37:14,349 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;@30d36374, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:37:14,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:37:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 204 states have (on average 1.553921568627451) internal successors, (317), 208 states have internal predecessors, (317), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 05:37:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:37:14,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:14,367 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:14,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1422546338, now seen corresponding path program 1 times [2025-03-08 05:37:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763867359] [2025-03-08 05:37:14,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:14,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:37:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:37:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:14,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:37:14,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763867359] [2025-03-08 05:37:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763867359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:14,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356085989] [2025-03-08 05:37:14,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:14,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:14,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:14,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:37:14,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:37:15,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:37:15,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:37:15,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:15,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:15,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:37:15,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:37:15,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:37:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356085989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:37:15,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:37:15,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244631547] [2025-03-08 05:37:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:15,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:15,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:15,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:37:15,299 INFO L87 Difference]: Start difference. First operand has 260 states, 204 states have (on average 1.553921568627451) internal successors, (317), 208 states have internal predecessors, (317), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:37:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:15,360 INFO L93 Difference]: Finished difference Result 374 states and 558 transitions. [2025-03-08 05:37:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-08 05:37:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:15,372 INFO L225 Difference]: With dead ends: 374 [2025-03-08 05:37:15,372 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 05:37:15,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 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-03-08 05:37:15,377 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 0 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:15,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 05:37:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-08 05:37:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 202 states have internal predecessors, (308), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 05:37:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2025-03-08 05:37:15,433 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 86 [2025-03-08 05:37:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:15,435 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2025-03-08 05:37:15,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:37:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2025-03-08 05:37:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:37:15,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:15,444 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:15,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:37:15,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:37:15,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:15,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1666121766, now seen corresponding path program 1 times [2025-03-08 05:37:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102828131] [2025-03-08 05:37:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:15,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:37:15,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:37:15,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:15,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:37:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102828131] [2025-03-08 05:37:15,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102828131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016398869] [2025-03-08 05:37:15,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:15,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:15,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:15,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:37:15,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:37:16,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:37:16,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:37:16,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:16,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:16,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:37:16,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:37:16,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:37:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016398869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:16,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:37:16,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:37:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261225732] [2025-03-08 05:37:16,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:16,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:16,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:16,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:37:16,116 INFO L87 Difference]: Start difference. First operand 254 states and 385 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:37:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:16,151 INFO L93 Difference]: Finished difference Result 532 states and 820 transitions. [2025-03-08 05:37:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:16,152 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-03-08 05:37:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:16,156 INFO L225 Difference]: With dead ends: 532 [2025-03-08 05:37:16,156 INFO L226 Difference]: Without dead ends: 304 [2025-03-08 05:37:16,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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-03-08 05:37:16,158 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 99 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 729 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-03-08 05:37:16,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 729 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-08 05:37:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2025-03-08 05:37:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.565217391304348) internal successors, (360), 233 states have internal predecessors, (360), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 05:37:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 459 transitions. [2025-03-08 05:37:16,193 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 459 transitions. Word has length 90 [2025-03-08 05:37:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:16,193 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 459 transitions. [2025-03-08 05:37:16,194 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:37:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 459 transitions. [2025-03-08 05:37:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 05:37:16,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:16,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:16,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:37:16,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:37:16,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:16,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1600328531, now seen corresponding path program 1 times [2025-03-08 05:37:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:16,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191182561] [2025-03-08 05:37:16,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:16,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:37:16,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:37:16,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:16,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:37:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:16,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191182561] [2025-03-08 05:37:16,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191182561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:16,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541628291] [2025-03-08 05:37:16,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:16,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:16,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:16,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:37:16,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:37:16,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:37:16,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:37:16,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:16,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:16,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:37:16,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:37:16,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:37:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541628291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:16,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:37:16,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:37:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566852730] [2025-03-08 05:37:16,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:16,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:16,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:16,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:37:16,893 INFO L87 Difference]: Start difference. First operand 296 states and 459 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:37:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:16,952 INFO L93 Difference]: Finished difference Result 583 states and 908 transitions. [2025-03-08 05:37:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:16,953 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2025-03-08 05:37:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:16,955 INFO L225 Difference]: With dead ends: 583 [2025-03-08 05:37:16,955 INFO L226 Difference]: Without dead ends: 298 [2025-03-08 05:37:16,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 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-03-08 05:37:16,959 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 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-03-08 05:37:16,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-08 05:37:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-08 05:37:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 231 states have (on average 1.5627705627705628) internal successors, (361), 235 states have internal predecessors, (361), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2025-03-08 05:37:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 462 transitions. [2025-03-08 05:37:16,978 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 462 transitions. Word has length 91 [2025-03-08 05:37:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 462 transitions. [2025-03-08 05:37:16,979 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:37:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 462 transitions. [2025-03-08 05:37:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:37:16,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:16,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:16,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:37:17,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:17,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:17,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1571415346, now seen corresponding path program 1 times [2025-03-08 05:37:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:17,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233953961] [2025-03-08 05:37:17,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:17,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:17,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:37:17,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:37:17,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:17,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:37:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233953961] [2025-03-08 05:37:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233953961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497254820] [2025-03-08 05:37:17,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:17,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:17,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:17,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:37:17,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:37:17,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:37:17,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:37:17,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:17,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:17,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:37:17,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:37:17,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:37:17,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497254820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:17,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:37:17,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:37:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986452693] [2025-03-08 05:37:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:17,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:17,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:17,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:37:17,606 INFO L87 Difference]: Start difference. First operand 298 states and 462 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:37:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:17,657 INFO L93 Difference]: Finished difference Result 585 states and 913 transitions. [2025-03-08 05:37:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:17,659 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2025-03-08 05:37:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:17,663 INFO L225 Difference]: With dead ends: 585 [2025-03-08 05:37:17,663 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 05:37:17,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 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-03-08 05:37:17,666 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1479 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-03-08 05:37:17,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1479 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 05:37:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-08 05:37:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 237 states have internal predecessors, (362), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2025-03-08 05:37:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 468 transitions. [2025-03-08 05:37:17,684 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 468 transitions. Word has length 92 [2025-03-08 05:37:17,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:17,685 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 468 transitions. [2025-03-08 05:37:17,685 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:37:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 468 transitions. [2025-03-08 05:37:17,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:37:17,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:17,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:17,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:37:17,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:17,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:17,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1432458141, now seen corresponding path program 1 times [2025-03-08 05:37:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289470212] [2025-03-08 05:37:17,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:17,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:37:17,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:37:17,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:17,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:37:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289470212] [2025-03-08 05:37:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289470212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491747382] [2025-03-08 05:37:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:18,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:18,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:18,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:18,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:18,024 INFO L87 Difference]: Start difference. First operand 300 states and 468 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:37:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:18,063 INFO L93 Difference]: Finished difference Result 577 states and 904 transitions. [2025-03-08 05:37:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:18,063 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-03-08 05:37:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:18,065 INFO L225 Difference]: With dead ends: 577 [2025-03-08 05:37:18,065 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 05:37:18,066 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-03-08 05:37:18,067 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1497 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-03-08 05:37:18,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1497 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 05:37:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-08 05:37:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 237 states have internal predecessors, (362), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2025-03-08 05:37:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 467 transitions. [2025-03-08 05:37:18,079 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 467 transitions. Word has length 93 [2025-03-08 05:37:18,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:18,079 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 467 transitions. [2025-03-08 05:37:18,079 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:37:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 467 transitions. [2025-03-08 05:37:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:37:18,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:18,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:18,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:37:18,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:18,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 239377152, now seen corresponding path program 2 times [2025-03-08 05:37:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173092291] [2025-03-08 05:37:18,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:37:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:18,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-03-08 05:37:18,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:37:18,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:37:18,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:37:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173092291] [2025-03-08 05:37:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173092291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:18,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:18,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:18,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999456197] [2025-03-08 05:37:18,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:18,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:18,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:18,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:18,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:18,222 INFO L87 Difference]: Start difference. First operand 300 states and 467 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:37:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:18,267 INFO L93 Difference]: Finished difference Result 575 states and 899 transitions. [2025-03-08 05:37:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-03-08 05:37:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:18,269 INFO L225 Difference]: With dead ends: 575 [2025-03-08 05:37:18,270 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 05:37:18,271 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-03-08 05:37:18,272 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 2 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:18,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1483 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 05:37:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-08 05:37:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 237 states have internal predecessors, (362), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (54), 49 states have call predecessors, (54), 49 states have call successors, (54) [2025-03-08 05:37:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 466 transitions. [2025-03-08 05:37:18,287 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 466 transitions. Word has length 94 [2025-03-08 05:37:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:18,287 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 466 transitions. [2025-03-08 05:37:18,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:37:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 466 transitions. [2025-03-08 05:37:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:37:18,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:18,289 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] [2025-03-08 05:37:18,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:37:18,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:18,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1202535927, now seen corresponding path program 3 times [2025-03-08 05:37:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521672186] [2025-03-08 05:37:18,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:37:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:18,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 3 equivalence classes. [2025-03-08 05:37:18,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 83 of 95 statements. [2025-03-08 05:37:18,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:37:18,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:37:18,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:18,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521672186] [2025-03-08 05:37:18,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521672186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:18,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:18,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122779433] [2025-03-08 05:37:18,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:18,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:18,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:18,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:18,393 INFO L87 Difference]: Start difference. First operand 300 states and 466 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:37:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:18,406 INFO L93 Difference]: Finished difference Result 451 states and 681 transitions. [2025-03-08 05:37:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:18,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2025-03-08 05:37:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:18,409 INFO L225 Difference]: With dead ends: 451 [2025-03-08 05:37:18,409 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 05:37:18,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-08 05:37:18,410 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 279 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 516 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-03-08 05:37:18,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 516 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 05:37:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-03-08 05:37:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 272 states have (on average 1.5588235294117647) internal successors, (424), 277 states have internal predecessors, (424), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (58), 53 states have call predecessors, (58), 53 states have call successors, (58) [2025-03-08 05:37:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 536 transitions. [2025-03-08 05:37:18,422 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 536 transitions. Word has length 95 [2025-03-08 05:37:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 536 transitions. [2025-03-08 05:37:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:37:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 536 transitions. [2025-03-08 05:37:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:37:18,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:18,428 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:18,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:37:18,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:18,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash 533658326, now seen corresponding path program 1 times [2025-03-08 05:37:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275073950] [2025-03-08 05:37:18,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:18,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:37:18,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:37:18,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:18,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:37:18,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275073950] [2025-03-08 05:37:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275073950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:18,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712452976] [2025-03-08 05:37:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:18,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:18,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:18,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:18,578 INFO L87 Difference]: Start difference. First operand 349 states and 536 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:37:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:18,612 INFO L93 Difference]: Finished difference Result 677 states and 1045 transitions. [2025-03-08 05:37:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:18,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-03-08 05:37:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:18,615 INFO L225 Difference]: With dead ends: 677 [2025-03-08 05:37:18,615 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 05:37:18,616 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-03-08 05:37:18,616 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 1 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1496 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-03-08 05:37:18,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1496 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 05:37:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-08 05:37:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.5567765567765568) internal successors, (425), 279 states have internal predecessors, (425), 54 states have call successors, (54), 21 states have call predecessors, (54), 23 states have return successors, (60), 53 states have call predecessors, (60), 53 states have call successors, (60) [2025-03-08 05:37:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 539 transitions. [2025-03-08 05:37:18,629 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 539 transitions. Word has length 149 [2025-03-08 05:37:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:18,629 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 539 transitions. [2025-03-08 05:37:18,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:37:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 539 transitions. [2025-03-08 05:37:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 05:37:18,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:18,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:18,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:37:18,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:18,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1200402704, now seen corresponding path program 1 times [2025-03-08 05:37:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:18,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057344334] [2025-03-08 05:37:18,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:18,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:18,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:37:18,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:37:18,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:18,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:37:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:18,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057344334] [2025-03-08 05:37:18,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057344334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:18,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:18,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:37:18,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520970387] [2025-03-08 05:37:18,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:18,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:37:18,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:18,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:37:18,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:37:18,829 INFO L87 Difference]: Start difference. First operand 351 states and 539 transitions. Second operand has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:37:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:18,948 INFO L93 Difference]: Finished difference Result 682 states and 1054 transitions. [2025-03-08 05:37:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:37:18,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 150 [2025-03-08 05:37:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:18,951 INFO L225 Difference]: With dead ends: 682 [2025-03-08 05:37:18,951 INFO L226 Difference]: Without dead ends: 356 [2025-03-08 05:37:18,953 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-03-08 05:37:18,953 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 5 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:18,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2554 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:37:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-08 05:37:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-08 05:37:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 277 states have (on average 1.552346570397112) internal successors, (430), 283 states have internal predecessors, (430), 54 states have call successors, (54), 22 states have call predecessors, (54), 24 states have return successors, (65), 53 states have call predecessors, (65), 53 states have call successors, (65) [2025-03-08 05:37:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 549 transitions. [2025-03-08 05:37:18,969 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 549 transitions. Word has length 150 [2025-03-08 05:37:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:18,969 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 549 transitions. [2025-03-08 05:37:18,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:37:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 549 transitions. [2025-03-08 05:37:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 05:37:18,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:18,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:18,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:37:18,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:18,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2097011960, now seen corresponding path program 1 times [2025-03-08 05:37:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:18,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349702041] [2025-03-08 05:37:18,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:18,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:37:18,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:37:18,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:18,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349702041] [2025-03-08 05:37:19,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349702041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328098426] [2025-03-08 05:37:19,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:19,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:19,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:37:19,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:37:19,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:37:19,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:37:19,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:19,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:19,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:37:19,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 05:37:19,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:37:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328098426] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:37:19,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:37:19,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:37:19,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839797429] [2025-03-08 05:37:19,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:37:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:37:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:19,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:37:19,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:37:19,511 INFO L87 Difference]: Start difference. First operand 356 states and 549 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:37:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:19,623 INFO L93 Difference]: Finished difference Result 828 states and 1326 transitions. [2025-03-08 05:37:19,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:37:19,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 151 [2025-03-08 05:37:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:19,630 INFO L225 Difference]: With dead ends: 828 [2025-03-08 05:37:19,631 INFO L226 Difference]: Without dead ends: 672 [2025-03-08 05:37:19,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 299 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-03-08 05:37:19,632 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 291 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:19,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1848 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:37:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-08 05:37:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 648. [2025-03-08 05:37:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 505 states have (on average 1.617821782178218) internal successors, (817), 511 states have internal predecessors, (817), 118 states have call successors, (118), 22 states have call predecessors, (118), 24 states have return successors, (139), 117 states have call predecessors, (139), 117 states have call successors, (139) [2025-03-08 05:37:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1074 transitions. [2025-03-08 05:37:19,666 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1074 transitions. Word has length 151 [2025-03-08 05:37:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:19,666 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 1074 transitions. [2025-03-08 05:37:19,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:37:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1074 transitions. [2025-03-08 05:37:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:37:19,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:19,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:19,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:37:19,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:37:19,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:19,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 483415906, now seen corresponding path program 1 times [2025-03-08 05:37:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:19,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468888808] [2025-03-08 05:37:19,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:19,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:19,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:37:19,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:37:19,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:19,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:19,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468888808] [2025-03-08 05:37:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468888808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:19,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:19,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827678355] [2025-03-08 05:37:19,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:19,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:19,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:19,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:19,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:19,939 INFO L87 Difference]: Start difference. First operand 648 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:19,971 INFO L93 Difference]: Finished difference Result 1525 states and 2568 transitions. [2025-03-08 05:37:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:19,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 158 [2025-03-08 05:37:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:19,976 INFO L225 Difference]: With dead ends: 1525 [2025-03-08 05:37:19,977 INFO L226 Difference]: Without dead ends: 944 [2025-03-08 05:37:19,979 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-03-08 05:37:19,979 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 97 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 767 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-03-08 05:37:19,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 767 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-08 05:37:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 936. [2025-03-08 05:37:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 729 states have (on average 1.6323731138545954) internal successors, (1190), 735 states have internal predecessors, (1190), 182 states have call successors, (182), 22 states have call predecessors, (182), 24 states have return successors, (213), 181 states have call predecessors, (213), 181 states have call successors, (213) [2025-03-08 05:37:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1585 transitions. [2025-03-08 05:37:20,019 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1585 transitions. Word has length 158 [2025-03-08 05:37:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:20,019 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1585 transitions. [2025-03-08 05:37:20,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1585 transitions. [2025-03-08 05:37:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 05:37:20,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:20,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:20,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:37:20,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:20,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash -428892740, now seen corresponding path program 1 times [2025-03-08 05:37:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:20,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374374904] [2025-03-08 05:37:20,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:20,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 05:37:20,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 05:37:20,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:20,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374374904] [2025-03-08 05:37:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374374904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068347633] [2025-03-08 05:37:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:20,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:20,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:20,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:20,122 INFO L87 Difference]: Start difference. First operand 936 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:20,170 INFO L93 Difference]: Finished difference Result 2212 states and 3769 transitions. [2025-03-08 05:37:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 159 [2025-03-08 05:37:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:20,177 INFO L225 Difference]: With dead ends: 2212 [2025-03-08 05:37:20,178 INFO L226 Difference]: Without dead ends: 1392 [2025-03-08 05:37:20,181 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-03-08 05:37:20,181 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 95 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 760 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-03-08 05:37:20,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-08 05:37:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1384. [2025-03-08 05:37:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1082 states have (on average 1.6423290203327172) internal successors, (1777), 1088 states have internal predecessors, (1777), 277 states have call successors, (277), 22 states have call predecessors, (277), 24 states have return successors, (308), 276 states have call predecessors, (308), 276 states have call successors, (308) [2025-03-08 05:37:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2362 transitions. [2025-03-08 05:37:20,254 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2362 transitions. Word has length 159 [2025-03-08 05:37:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:20,255 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2362 transitions. [2025-03-08 05:37:20,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2362 transitions. [2025-03-08 05:37:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:37:20,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:20,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:20,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:37:20,263 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:20,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash -490762591, now seen corresponding path program 1 times [2025-03-08 05:37:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:20,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463234516] [2025-03-08 05:37:20,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:20,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:37:20,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:37:20,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:20,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463234516] [2025-03-08 05:37:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463234516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:20,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158773526] [2025-03-08 05:37:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:20,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:20,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:20,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:20,341 INFO L87 Difference]: Start difference. First operand 1384 states and 2362 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:20,410 INFO L93 Difference]: Finished difference Result 3213 states and 5530 transitions. [2025-03-08 05:37:20,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:20,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 160 [2025-03-08 05:37:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:20,424 INFO L225 Difference]: With dead ends: 3213 [2025-03-08 05:37:20,424 INFO L226 Difference]: Without dead ends: 2063 [2025-03-08 05:37:20,429 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-03-08 05:37:20,429 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 93 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 755 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-03-08 05:37:20,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 755 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-03-08 05:37:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2055. [2025-03-08 05:37:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1630 states have (on average 1.650920245398773) internal successors, (2691), 1636 states have internal predecessors, (2691), 400 states have call successors, (400), 22 states have call predecessors, (400), 24 states have return successors, (447), 399 states have call predecessors, (447), 399 states have call successors, (447) [2025-03-08 05:37:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3538 transitions. [2025-03-08 05:37:20,527 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3538 transitions. Word has length 160 [2025-03-08 05:37:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:20,528 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 3538 transitions. [2025-03-08 05:37:20,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3538 transitions. [2025-03-08 05:37:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 05:37:20,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:20,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:20,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:37:20,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 916292637, now seen corresponding path program 1 times [2025-03-08 05:37:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194749139] [2025-03-08 05:37:20,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:20,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 05:37:20,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 05:37:20,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:20,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194749139] [2025-03-08 05:37:20,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194749139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:20,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:20,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090992214] [2025-03-08 05:37:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:20,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:20,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:20,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:20,632 INFO L87 Difference]: Start difference. First operand 2055 states and 3538 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:20,720 INFO L93 Difference]: Finished difference Result 4755 states and 8250 transitions. [2025-03-08 05:37:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:20,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2025-03-08 05:37:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:20,739 INFO L225 Difference]: With dead ends: 4755 [2025-03-08 05:37:20,739 INFO L226 Difference]: Without dead ends: 3127 [2025-03-08 05:37:20,746 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-03-08 05:37:20,747 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 91 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 755 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-03-08 05:37:20,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 755 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2025-03-08 05:37:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3119. [2025-03-08 05:37:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 2515 states have (on average 1.656858846918489) internal successors, (4167), 2521 states have internal predecessors, (4167), 579 states have call successors, (579), 22 states have call predecessors, (579), 24 states have return successors, (652), 578 states have call predecessors, (652), 578 states have call successors, (652) [2025-03-08 05:37:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 5398 transitions. [2025-03-08 05:37:20,898 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 5398 transitions. Word has length 161 [2025-03-08 05:37:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:20,899 INFO L471 AbstractCegarLoop]: Abstraction has 3119 states and 5398 transitions. [2025-03-08 05:37:20,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 5398 transitions. [2025-03-08 05:37:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:37:20,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:20,915 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:20,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:37:20,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:20,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1898938624, now seen corresponding path program 1 times [2025-03-08 05:37:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:20,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290923477] [2025-03-08 05:37:20,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:20,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:37:20,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:37:20,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:20,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290923477] [2025-03-08 05:37:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290923477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:21,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:21,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:21,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050385985] [2025-03-08 05:37:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:21,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:21,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:21,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:21,015 INFO L87 Difference]: Start difference. First operand 3119 states and 5398 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:21,145 INFO L93 Difference]: Finished difference Result 7540 states and 13116 transitions. [2025-03-08 05:37:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2025-03-08 05:37:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:21,177 INFO L225 Difference]: With dead ends: 7540 [2025-03-08 05:37:21,177 INFO L226 Difference]: Without dead ends: 5064 [2025-03-08 05:37:21,189 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-03-08 05:37:21,190 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 89 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 774 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-03-08 05:37:21,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 774 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2025-03-08 05:37:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5056. [2025-03-08 05:37:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 4076 states have (on average 1.649901864573111) internal successors, (6725), 4082 states have internal predecessors, (6725), 955 states have call successors, (955), 22 states have call predecessors, (955), 24 states have return successors, (1072), 954 states have call predecessors, (1072), 954 states have call successors, (1072) [2025-03-08 05:37:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 8752 transitions. [2025-03-08 05:37:21,461 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 8752 transitions. Word has length 162 [2025-03-08 05:37:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:21,461 INFO L471 AbstractCegarLoop]: Abstraction has 5056 states and 8752 transitions. [2025-03-08 05:37:21,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 8752 transitions. [2025-03-08 05:37:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:37:21,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:21,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:21,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:37:21,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:21,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1694666306, now seen corresponding path program 1 times [2025-03-08 05:37:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140524893] [2025-03-08 05:37:21,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:21,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:37:21,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:37:21,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:21,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:21,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:21,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140524893] [2025-03-08 05:37:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140524893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:21,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814503836] [2025-03-08 05:37:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:21,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:21,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:21,563 INFO L87 Difference]: Start difference. First operand 5056 states and 8752 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:21,827 INFO L93 Difference]: Finished difference Result 12444 states and 21676 transitions. [2025-03-08 05:37:21,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:21,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2025-03-08 05:37:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:21,879 INFO L225 Difference]: With dead ends: 12444 [2025-03-08 05:37:21,879 INFO L226 Difference]: Without dead ends: 8386 [2025-03-08 05:37:21,898 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-03-08 05:37:21,898 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 87 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 758 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-03-08 05:37:21,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 758 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8386 states. [2025-03-08 05:37:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8386 to 8378. [2025-03-08 05:37:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8378 states, 6792 states have (on average 1.6479681978798586) internal successors, (11193), 6798 states have internal predecessors, (11193), 1561 states have call successors, (1561), 22 states have call predecessors, (1561), 24 states have return successors, (1756), 1560 states have call predecessors, (1756), 1560 states have call successors, (1756) [2025-03-08 05:37:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8378 states to 8378 states and 14510 transitions. [2025-03-08 05:37:22,396 INFO L78 Accepts]: Start accepts. Automaton has 8378 states and 14510 transitions. Word has length 163 [2025-03-08 05:37:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:22,396 INFO L471 AbstractCegarLoop]: Abstraction has 8378 states and 14510 transitions. [2025-03-08 05:37:22,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 8378 states and 14510 transitions. [2025-03-08 05:37:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:37:22,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:22,440 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:22,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:37:22,440 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:22,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1512360193, now seen corresponding path program 1 times [2025-03-08 05:37:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335302962] [2025-03-08 05:37:22,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:22,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:37:22,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:37:22,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:22,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335302962] [2025-03-08 05:37:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335302962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:22,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836081113] [2025-03-08 05:37:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:22,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:22,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:22,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:22,528 INFO L87 Difference]: Start difference. First operand 8378 states and 14510 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:22,878 INFO L93 Difference]: Finished difference Result 21663 states and 37661 transitions. [2025-03-08 05:37:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:22,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-08 05:37:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:22,959 INFO L225 Difference]: With dead ends: 21663 [2025-03-08 05:37:22,959 INFO L226 Difference]: Without dead ends: 14676 [2025-03-08 05:37:22,990 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-03-08 05:37:22,991 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 85 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 776 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-03-08 05:37:22,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 776 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14676 states. [2025-03-08 05:37:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14676 to 14668. [2025-03-08 05:37:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14668 states, 11879 states have (on average 1.6378483037292701) internal successors, (19456), 11885 states have internal predecessors, (19456), 2764 states have call successors, (2764), 22 states have call predecessors, (2764), 24 states have return successors, (3103), 2763 states have call predecessors, (3103), 2763 states have call successors, (3103) [2025-03-08 05:37:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14668 states to 14668 states and 25323 transitions. [2025-03-08 05:37:23,569 INFO L78 Accepts]: Start accepts. Automaton has 14668 states and 25323 transitions. Word has length 164 [2025-03-08 05:37:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:23,570 INFO L471 AbstractCegarLoop]: Abstraction has 14668 states and 25323 transitions. [2025-03-08 05:37:23,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 14668 states and 25323 transitions. [2025-03-08 05:37:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 05:37:23,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:23,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:23,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:37:23,634 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:23,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1624895519, now seen corresponding path program 1 times [2025-03-08 05:37:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:23,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622605299] [2025-03-08 05:37:23,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:23,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:37:23,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:37:23,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:23,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:23,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:23,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622605299] [2025-03-08 05:37:23,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622605299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:23,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:23,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:23,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158847980] [2025-03-08 05:37:23,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:23,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:23,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:23,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:23,695 INFO L87 Difference]: Start difference. First operand 14668 states and 25323 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:24,543 INFO L93 Difference]: Finished difference Result 38784 states and 67269 transitions. [2025-03-08 05:37:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:24,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 165 [2025-03-08 05:37:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:24,675 INFO L225 Difference]: With dead ends: 38784 [2025-03-08 05:37:24,675 INFO L226 Difference]: Without dead ends: 26077 [2025-03-08 05:37:24,743 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-03-08 05:37:24,744 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 83 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 758 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-03-08 05:37:24,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 758 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26077 states. [2025-03-08 05:37:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26077 to 26069. [2025-03-08 05:37:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26069 states, 21241 states have (on average 1.6333976743091192) internal successors, (34695), 21247 states have internal predecessors, (34695), 4803 states have call successors, (4803), 22 states have call predecessors, (4803), 24 states have return successors, (5416), 4802 states have call predecessors, (5416), 4802 states have call successors, (5416) [2025-03-08 05:37:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26069 states to 26069 states and 44914 transitions. [2025-03-08 05:37:25,780 INFO L78 Accepts]: Start accepts. Automaton has 26069 states and 44914 transitions. Word has length 165 [2025-03-08 05:37:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:25,781 INFO L471 AbstractCegarLoop]: Abstraction has 26069 states and 44914 transitions. [2025-03-08 05:37:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 26069 states and 44914 transitions. [2025-03-08 05:37:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:37:25,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:25,852 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:25,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:37:25,853 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash 87254951, now seen corresponding path program 2 times [2025-03-08 05:37:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905678356] [2025-03-08 05:37:25,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:37:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:25,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 166 statements into 2 equivalence classes. [2025-03-08 05:37:25,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:37:25,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:37:25,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-08 05:37:25,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:25,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905678356] [2025-03-08 05:37:25,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905678356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:25,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:25,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:25,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241087302] [2025-03-08 05:37:25,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:25,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:25,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:25,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:25,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:25,935 INFO L87 Difference]: Start difference. First operand 26069 states and 44914 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:26,518 INFO L93 Difference]: Finished difference Result 49282 states and 85063 transitions. [2025-03-08 05:37:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:26,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 166 [2025-03-08 05:37:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:26,623 INFO L225 Difference]: With dead ends: 49282 [2025-03-08 05:37:26,624 INFO L226 Difference]: Without dead ends: 26077 [2025-03-08 05:37:26,678 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-03-08 05:37:26,679 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 96 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:26,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 891 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26077 states. [2025-03-08 05:37:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26077 to 26069. [2025-03-08 05:37:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26069 states, 21241 states have (on average 1.6208747234122687) internal successors, (34429), 21247 states have internal predecessors, (34429), 4803 states have call successors, (4803), 22 states have call predecessors, (4803), 24 states have return successors, (5416), 4802 states have call predecessors, (5416), 4802 states have call successors, (5416) [2025-03-08 05:37:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26069 states to 26069 states and 44648 transitions. [2025-03-08 05:37:27,845 INFO L78 Accepts]: Start accepts. Automaton has 26069 states and 44648 transitions. Word has length 166 [2025-03-08 05:37:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:27,846 INFO L471 AbstractCegarLoop]: Abstraction has 26069 states and 44648 transitions. [2025-03-08 05:37:27,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 26069 states and 44648 transitions. [2025-03-08 05:37:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:37:27,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:27,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:27,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:37:27,945 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:27,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1099089438, now seen corresponding path program 1 times [2025-03-08 05:37:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918324655] [2025-03-08 05:37:27,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:27,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:37:27,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:37:27,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:27,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:28,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:28,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918324655] [2025-03-08 05:37:28,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918324655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:28,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:28,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:28,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964649469] [2025-03-08 05:37:28,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:28,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:28,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:28,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:28,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:28,022 INFO L87 Difference]: Start difference. First operand 26069 states and 44648 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:29,299 INFO L93 Difference]: Finished difference Result 70956 states and 121941 transitions. [2025-03-08 05:37:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:29,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 166 [2025-03-08 05:37:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:29,513 INFO L225 Difference]: With dead ends: 70956 [2025-03-08 05:37:29,513 INFO L226 Difference]: Without dead ends: 47534 [2025-03-08 05:37:29,581 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-03-08 05:37:29,583 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 81 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 761 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-03-08 05:37:29,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 761 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47534 states. [2025-03-08 05:37:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47534 to 47526. [2025-03-08 05:37:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47526 states, 38983 states have (on average 1.614062540081574) internal successors, (62921), 38989 states have internal predecessors, (62921), 8518 states have call successors, (8518), 22 states have call predecessors, (8518), 24 states have return successors, (9663), 8517 states have call predecessors, (9663), 8517 states have call successors, (9663) [2025-03-08 05:37:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47526 states to 47526 states and 81102 transitions. [2025-03-08 05:37:31,176 INFO L78 Accepts]: Start accepts. Automaton has 47526 states and 81102 transitions. Word has length 166 [2025-03-08 05:37:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:31,177 INFO L471 AbstractCegarLoop]: Abstraction has 47526 states and 81102 transitions. [2025-03-08 05:37:31,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 47526 states and 81102 transitions. [2025-03-08 05:37:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:37:31,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:31,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:31,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:37:31,307 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:31,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash -448382176, now seen corresponding path program 1 times [2025-03-08 05:37:31,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:31,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173346360] [2025-03-08 05:37:31,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:31,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:31,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:37:31,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:37:31,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:31,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:37:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173346360] [2025-03-08 05:37:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173346360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:31,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365471867] [2025-03-08 05:37:31,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:31,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:31,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:31,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:31,367 INFO L87 Difference]: Start difference. First operand 47526 states and 81102 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:33,162 INFO L93 Difference]: Finished difference Result 88413 states and 151218 transitions. [2025-03-08 05:37:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:33,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 167 [2025-03-08 05:37:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:33,555 INFO L225 Difference]: With dead ends: 88413 [2025-03-08 05:37:33,555 INFO L226 Difference]: Without dead ends: 88257 [2025-03-08 05:37:33,600 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-03-08 05:37:33,601 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 76 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:33,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 764 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88257 states. [2025-03-08 05:37:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88257 to 88249. [2025-03-08 05:37:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88249 states, 72907 states have (on average 1.605785452700015) internal successors, (117073), 72913 states have internal predecessors, (117073), 15317 states have call successors, (15317), 22 states have call predecessors, (15317), 24 states have return successors, (17508), 15316 states have call predecessors, (17508), 15316 states have call successors, (17508) [2025-03-08 05:37:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88249 states to 88249 states and 149898 transitions. [2025-03-08 05:37:36,766 INFO L78 Accepts]: Start accepts. Automaton has 88249 states and 149898 transitions. Word has length 167 [2025-03-08 05:37:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:36,766 INFO L471 AbstractCegarLoop]: Abstraction has 88249 states and 149898 transitions. [2025-03-08 05:37:36,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:37:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 88249 states and 149898 transitions. [2025-03-08 05:37:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 05:37:36,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:36,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:37:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:37:36,930 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1314728707, now seen corresponding path program 1 times [2025-03-08 05:37:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596532920] [2025-03-08 05:37:36,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:36,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:37:36,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:37:36,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:36,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:37:37,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:37,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596532920] [2025-03-08 05:37:37,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596532920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:37,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634173289] [2025-03-08 05:37:37,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:37,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:37,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:37,168 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:37:37,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:37:37,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:37:37,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:37:37,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:37,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:37,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:37:37,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:37:38,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:37:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:37:38,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634173289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:37:38,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:37:38,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2025-03-08 05:37:38,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866029858] [2025-03-08 05:37:38,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:37:38,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 05:37:38,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:38,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 05:37:38,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:37:38,642 INFO L87 Difference]: Start difference. First operand 88249 states and 149898 transitions. Second operand has 32 states, 32 states have (on average 9.09375) internal successors, (291), 29 states have internal predecessors, (291), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) [2025-03-08 05:37:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:44,525 INFO L93 Difference]: Finished difference Result 176189 states and 304670 transitions. [2025-03-08 05:37:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 05:37:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.09375) internal successors, (291), 29 states have internal predecessors, (291), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) Word has length 168 [2025-03-08 05:37:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:45,487 INFO L225 Difference]: With dead ends: 176189 [2025-03-08 05:37:45,487 INFO L226 Difference]: Without dead ends: 176050 [2025-03-08 05:37:45,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=434, Invalid=2218, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 05:37:45,555 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 2623 mSDsluCounter, 7570 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2626 SdHoareTripleChecker+Valid, 8188 SdHoareTripleChecker+Invalid, 2644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:45,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2626 Valid, 8188 Invalid, 2644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:37:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176050 states.