./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_spec0_product05.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 74a12e124f66b10df64ef68155d31c3be83012aab827a45870f5335a6569b75a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:19:11,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:19:11,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:19:11,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:19:11,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:19:11,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:19:11,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:19:11,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:19:11,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:19:11,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:19:11,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:19:11,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:19:11,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:19:11,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:19:11,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:19:11,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:19:11,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:19:11,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:19:11,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:19:11,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:19:11,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:19:11,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:19:11,115 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 -> 74a12e124f66b10df64ef68155d31c3be83012aab827a45870f5335a6569b75a [2025-03-03 14:19:11,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:19:11,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:19:11,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:19:11,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:19:11,349 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:19:11,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2025-03-03 14:19:12,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d49ab1bd/a93f059db00c45dea033cd70bd3fbc0f/FLAG6918c6d2c [2025-03-03 14:19:12,875 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:19:12,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2025-03-03 14:19:12,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d49ab1bd/a93f059db00c45dea033cd70bd3fbc0f/FLAG6918c6d2c [2025-03-03 14:19:12,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d49ab1bd/a93f059db00c45dea033cd70bd3fbc0f [2025-03-03 14:19:12,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:19:12,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:19:12,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:19:12,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:19:12,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:19:12,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:19:12" (1/1) ... [2025-03-03 14:19:12,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cf4d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:12, skipping insertion in model container [2025-03-03 14:19:12,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:19:12" (1/1) ... [2025-03-03 14:19:12,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:19:13,122 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_spec0_product05.cil.c[4289,4302] [2025-03-03 14:19:13,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:19:13,366 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:19:13,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:19:13,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [202] [2025-03-03 14:19:13,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [211] [2025-03-03 14:19:13,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [403] [2025-03-03 14:19:13,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [815] [2025-03-03 14:19:13,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1181] [2025-03-03 14:19:13,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1201] [2025-03-03 14:19:13,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2279] [2025-03-03 14:19:13,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2435] [2025-03-03 14:19:13,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2452] [2025-03-03 14:19:13,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2515] [2025-03-03 14:19:13,386 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_spec0_product05.cil.c[4289,4302] [2025-03-03 14:19:13,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:19:13,485 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:19:13,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13 WrapperNode [2025-03-03 14:19:13,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:19:13,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:19:13,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:19:13,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:19:13,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,542 INFO L138 Inliner]: procedures = 107, calls = 113, calls flagged for inlining = 37, calls inlined = 30, statements flattened = 584 [2025-03-03 14:19:13,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:19:13,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:19:13,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:19:13,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:19:13,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,566 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-03-03 14:19:13,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:19:13,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:19:13,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:19:13,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:19:13,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (1/1) ... [2025-03-03 14:19:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:19:13,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:13,610 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-03 14:19:13,612 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-03 14:19:13,631 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:19:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:19:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:19:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:19:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:19:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:19:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:19:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:19:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:19:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:19:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:19:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:19:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:19:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:19:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:19:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:19:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:19:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:19:13,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:19:13,756 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:19:13,758 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:19:13,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2209-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~30#1; [2025-03-03 14:19:13,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L496-1: getEmailFrom_#res#1 := getEmailFrom_~retValue_acc~3#1; [2025-03-03 14:19:13,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L459-1: getEmailId_#res#1 := getEmailId_~retValue_acc~2#1; [2025-03-03 14:19:13,887 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2256-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2025-03-03 14:19:13,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2512-1: createEmail_#res#1 := createEmail_~retValue_acc~39#1; [2025-03-03 14:19:14,090 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2418-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~35#1; [2025-03-03 14:19:14,090 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2547-1: valid_product_#res#1 := valid_product_~retValue_acc~41#1; [2025-03-03 14:19:14,090 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2400-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~33#1; [2025-03-03 14:19:14,090 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~34#1; [2025-03-03 14:19:14,097 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: #res := ~retValue_acc~4; [2025-03-03 14:19:14,100 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2488: #res := ~retValue_acc~37; [2025-03-03 14:19:14,143 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-03-03 14:19:14,143 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:19:14,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:19:14,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:19:14,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:14 BoogieIcfgContainer [2025-03-03 14:19:14,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:19:14,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:19:14,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:19:14,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:19:14,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:19:12" (1/3) ... [2025-03-03 14:19:14,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff9602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:19:14, skipping insertion in model container [2025-03-03 14:19:14,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:13" (2/3) ... [2025-03-03 14:19:14,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff9602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:19:14, skipping insertion in model container [2025-03-03 14:19:14,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:14" (3/3) ... [2025-03-03 14:19:14,161 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product05.cil.c [2025-03-03 14:19:14,174 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:19:14,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product05.cil.c that has 8 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:19:14,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:19:14,242 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;@7f958e05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:19:14,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:19:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 109 states have internal predecessors, (158), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 14:19:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:19:14,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:14,257 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:19:14,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:14,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash 711069146, now seen corresponding path program 1 times [2025-03-03 14:19:14,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604444635] [2025-03-03 14:19:14,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:14,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:14,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:19:14,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:19:14,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:14,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:19:14,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:14,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604444635] [2025-03-03 14:19:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604444635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:14,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705119609] [2025-03-03 14:19:14,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:14,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:14,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:14,743 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-03 14:19:14,744 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-03 14:19:14,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:19:14,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:19:14,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:14,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:19:14,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:19:14,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705119609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:14,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:14,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:19:14,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981945845] [2025-03-03 14:19:14,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:14,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:19:14,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:15,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:19:15,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:15,015 INFO L87 Difference]: Start difference. First operand has 130 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 109 states have internal predecessors, (158), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:15,040 INFO L93 Difference]: Finished difference Result 211 states and 293 transitions. [2025-03-03 14:19:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:19:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2025-03-03 14:19:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:15,051 INFO L225 Difference]: With dead ends: 211 [2025-03-03 14:19:15,052 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 14:19:15,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 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-03 14:19:15,058 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:15,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 14:19:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-03 14:19:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 102 states have internal predecessors, (148), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 14:19:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2025-03-03 14:19:15,099 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 75 [2025-03-03 14:19:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:15,100 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2025-03-03 14:19:15,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2025-03-03 14:19:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:19:15,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:15,103 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:19:15,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:19:15,303 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-03 14:19:15,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1281741345, now seen corresponding path program 1 times [2025-03-03 14:19:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58003635] [2025-03-03 14:19:15,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:19:15,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:19:15,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:15,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:19:15,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58003635] [2025-03-03 14:19:15,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58003635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:15,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185530764] [2025-03-03 14:19:15,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:15,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:15,480 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-03 14:19:15,481 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-03 14:19:15,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:19:15,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:19:15,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:15,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:15,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:19:15,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:19:15,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:15,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185530764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:15,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:15,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:19:15,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875993535] [2025-03-03 14:19:15,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:15,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:15,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:15,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:15,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:15,716 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:15,740 INFO L93 Difference]: Finished difference Result 200 states and 274 transitions. [2025-03-03 14:19:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-03-03 14:19:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:15,745 INFO L225 Difference]: With dead ends: 200 [2025-03-03 14:19:15,745 INFO L226 Difference]: Without dead ends: 125 [2025-03-03 14:19:15,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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-03 14:19:15,746 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 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-03 14:19:15,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-03 14:19:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-03 14:19:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.4563106796116505) internal successors, (150), 104 states have internal predecessors, (150), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 14:19:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2025-03-03 14:19:15,759 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 76 [2025-03-03 14:19:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2025-03-03 14:19:15,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2025-03-03 14:19:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:19:15,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:15,761 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:19:15,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:19:15,966 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-03 14:19:15,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:15,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1691946011, now seen corresponding path program 1 times [2025-03-03 14:19:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:15,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76319320] [2025-03-03 14:19:15,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:15,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:19:15,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:19:15,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:15,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:19:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76319320] [2025-03-03 14:19:16,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76319320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683223235] [2025-03-03 14:19:16,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:16,161 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-03 14:19:16,162 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-03 14:19:16,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:19:16,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:19:16,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:16,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:16,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:19:16,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:19:16,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:16,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683223235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:16,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:16,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:19:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904037775] [2025-03-03 14:19:16,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:16,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:16,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:16,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:19:16,407 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:19:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:16,456 INFO L93 Difference]: Finished difference Result 243 states and 347 transitions. [2025-03-03 14:19:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:16,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 80 [2025-03-03 14:19:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:16,459 INFO L225 Difference]: With dead ends: 243 [2025-03-03 14:19:16,459 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 14:19:16,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 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-03 14:19:16,465 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 2 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 657 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-03 14:19:16,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 657 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 14:19:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-03 14:19:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 106 states have internal predecessors, (151), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-03 14:19:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2025-03-03 14:19:16,476 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 80 [2025-03-03 14:19:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:16,476 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2025-03-03 14:19:16,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:19:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2025-03-03 14:19:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:19:16,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:16,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:16,487 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-03 14:19:16,684 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-03 14:19:16,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:16,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1794497705, now seen corresponding path program 1 times [2025-03-03 14:19:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:16,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257845096] [2025-03-03 14:19:16,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:16,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:16,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:19:16,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:19:16,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:16,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:19:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257845096] [2025-03-03 14:19:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257845096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:16,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:16,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873524956] [2025-03-03 14:19:16,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:16,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:16,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:16,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:16,821 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:19:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:16,856 INFO L93 Difference]: Finished difference Result 235 states and 335 transitions. [2025-03-03 14:19:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 81 [2025-03-03 14:19:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:16,857 INFO L225 Difference]: With dead ends: 235 [2025-03-03 14:19:16,857 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 14:19:16,858 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-03 14:19:16,858 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 661 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-03 14:19:16,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 661 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 14:19:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-03 14:19:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 106 states have internal predecessors, (151), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-03 14:19:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 179 transitions. [2025-03-03 14:19:16,873 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 179 transitions. Word has length 81 [2025-03-03 14:19:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:16,873 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 179 transitions. [2025-03-03 14:19:16,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:19:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 179 transitions. [2025-03-03 14:19:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 14:19:16,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:16,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:16,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:19:16,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:16,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash -610461917, now seen corresponding path program 2 times [2025-03-03 14:19:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040044079] [2025-03-03 14:19:16,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:19:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:16,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-03 14:19:16,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 82 statements. [2025-03-03 14:19:16,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:19:16,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:19:16,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:16,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040044079] [2025-03-03 14:19:16,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040044079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:16,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:16,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392204853] [2025-03-03 14:19:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:16,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:16,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:16,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:16,987 INFO L87 Difference]: Start difference. First operand 127 states and 179 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:17,034 INFO L93 Difference]: Finished difference Result 302 states and 424 transitions. [2025-03-03 14:19:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:19:17,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2025-03-03 14:19:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:17,038 INFO L225 Difference]: With dead ends: 302 [2025-03-03 14:19:17,039 INFO L226 Difference]: Without dead ends: 235 [2025-03-03 14:19:17,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:17,040 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 141 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:17,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 664 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-03 14:19:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-03-03 14:19:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.471502590673575) internal successors, (284), 196 states have internal predecessors, (284), 25 states have call successors, (25), 13 states have call predecessors, (25), 14 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2025-03-03 14:19:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2025-03-03 14:19:17,055 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 82 [2025-03-03 14:19:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:17,055 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2025-03-03 14:19:17,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2025-03-03 14:19:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:19:17,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:17,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:17,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:19:17,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:17,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:17,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1866423035, now seen corresponding path program 1 times [2025-03-03 14:19:17,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:17,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786708887] [2025-03-03 14:19:17,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:17,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:17,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:19:17,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:19:17,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:17,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:19:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786708887] [2025-03-03 14:19:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786708887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:17,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:17,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140004338] [2025-03-03 14:19:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:17,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:17,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:17,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:17,182 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:19:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:17,220 INFO L93 Difference]: Finished difference Result 449 states and 646 transitions. [2025-03-03 14:19:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:17,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-03-03 14:19:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:17,224 INFO L225 Difference]: With dead ends: 449 [2025-03-03 14:19:17,224 INFO L226 Difference]: Without dead ends: 235 [2025-03-03 14:19:17,224 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-03 14:19:17,225 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 664 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-03 14:19:17,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 664 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-03 14:19:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-03-03 14:19:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 194 states have (on average 1.4690721649484537) internal successors, (285), 198 states have internal predecessors, (285), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-03-03 14:19:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 336 transitions. [2025-03-03 14:19:17,242 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 336 transitions. Word has length 83 [2025-03-03 14:19:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:17,242 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 336 transitions. [2025-03-03 14:19:17,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:19:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 336 transitions. [2025-03-03 14:19:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 14:19:17,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:17,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:17,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:19:17,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:17,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash 274634516, now seen corresponding path program 1 times [2025-03-03 14:19:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719393416] [2025-03-03 14:19:17,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:17,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:17,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:19:17,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:19:17,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:17,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719393416] [2025-03-03 14:19:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719393416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558446490] [2025-03-03 14:19:17,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:17,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:17,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:17,339 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-03 14:19:17,341 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-03 14:19:17,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:19:17,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:19:17,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:17,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:17,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:17,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:19:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558446490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:19:17,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:19:17,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:19:17,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088576499] [2025-03-03 14:19:17,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:19:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:17,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:17,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:17,639 INFO L87 Difference]: Start difference. First operand 235 states and 336 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:19:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:17,671 INFO L93 Difference]: Finished difference Result 576 states and 856 transitions. [2025-03-03 14:19:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 84 [2025-03-03 14:19:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:17,674 INFO L225 Difference]: With dead ends: 576 [2025-03-03 14:19:17,674 INFO L226 Difference]: Without dead ends: 424 [2025-03-03 14:19:17,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-03 14:19:17,675 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 282 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:17,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 694 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-03 14:19:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 384. [2025-03-03 14:19:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 343 states have (on average 1.629737609329446) internal successors, (559), 347 states have internal predecessors, (559), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-03-03 14:19:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 610 transitions. [2025-03-03 14:19:17,698 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 610 transitions. Word has length 84 [2025-03-03 14:19:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:17,698 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 610 transitions. [2025-03-03 14:19:17,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:19:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 610 transitions. [2025-03-03 14:19:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:19:17,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:17,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:17,707 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-03 14:19:17,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:17,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash 459224306, now seen corresponding path program 1 times [2025-03-03 14:19:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502342546] [2025-03-03 14:19:17,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:17,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:19:17,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:19:17,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:17,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:17,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:17,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502342546] [2025-03-03 14:19:17,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502342546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:17,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:17,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:17,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750110080] [2025-03-03 14:19:17,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:17,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:17,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:17,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:17,956 INFO L87 Difference]: Start difference. First operand 384 states and 610 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:17,975 INFO L93 Difference]: Finished difference Result 903 states and 1471 transitions. [2025-03-03 14:19:17,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:17,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2025-03-03 14:19:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:17,978 INFO L225 Difference]: With dead ends: 903 [2025-03-03 14:19:17,978 INFO L226 Difference]: Without dead ends: 546 [2025-03-03 14:19:17,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-03 14:19:17,980 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 57 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 345 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-03 14:19:17,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-03 14:19:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 530. [2025-03-03 14:19:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 489 states have (on average 1.6768916155419222) internal successors, (820), 493 states have internal predecessors, (820), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-03-03 14:19:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 871 transitions. [2025-03-03 14:19:17,998 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 871 transitions. Word has length 91 [2025-03-03 14:19:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:17,998 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 871 transitions. [2025-03-03 14:19:17,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 871 transitions. [2025-03-03 14:19:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:19:17,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:17,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:17,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:19:18,000 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2039099533, now seen corresponding path program 1 times [2025-03-03 14:19:18,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979187578] [2025-03-03 14:19:18,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:19:18,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:19:18,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979187578] [2025-03-03 14:19:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979187578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178347251] [2025-03-03 14:19:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:18,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:18,059 INFO L87 Difference]: Start difference. First operand 530 states and 871 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:18,077 INFO L93 Difference]: Finished difference Result 1275 states and 2135 transitions. [2025-03-03 14:19:18,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:18,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-03-03 14:19:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,081 INFO L225 Difference]: With dead ends: 1275 [2025-03-03 14:19:18,081 INFO L226 Difference]: Without dead ends: 779 [2025-03-03 14:19:18,082 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-03 14:19:18,082 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 55 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 344 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-03 14:19:18,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-03 14:19:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 763. [2025-03-03 14:19:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 722 states have (on average 1.7022160664819945) internal successors, (1229), 726 states have internal predecessors, (1229), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-03-03 14:19:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1280 transitions. [2025-03-03 14:19:18,108 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1280 transitions. Word has length 92 [2025-03-03 14:19:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,108 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1280 transitions. [2025-03-03 14:19:18,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1280 transitions. [2025-03-03 14:19:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:19:18,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:18,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:19:18,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1396597613, now seen corresponding path program 1 times [2025-03-03 14:19:18,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697505425] [2025-03-03 14:19:18,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:19:18,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:19:18,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697505425] [2025-03-03 14:19:18,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697505425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:18,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680450836] [2025-03-03 14:19:18,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:18,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:18,155 INFO L87 Difference]: Start difference. First operand 763 states and 1280 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:18,181 INFO L93 Difference]: Finished difference Result 1865 states and 3173 transitions. [2025-03-03 14:19:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2025-03-03 14:19:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,186 INFO L225 Difference]: With dead ends: 1865 [2025-03-03 14:19:18,186 INFO L226 Difference]: Without dead ends: 1153 [2025-03-03 14:19:18,188 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-03 14:19:18,188 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 53 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 344 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-03 14:19:18,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-03 14:19:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1137. [2025-03-03 14:19:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1096 states have (on average 1.7125912408759123) internal successors, (1877), 1100 states have internal predecessors, (1877), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-03-03 14:19:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1928 transitions. [2025-03-03 14:19:18,216 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1928 transitions. Word has length 93 [2025-03-03 14:19:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,217 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1928 transitions. [2025-03-03 14:19:18,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1928 transitions. [2025-03-03 14:19:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:19:18,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:18,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:19:18,220 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2089796882, now seen corresponding path program 1 times [2025-03-03 14:19:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749928028] [2025-03-03 14:19:18,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:19:18,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:19:18,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749928028] [2025-03-03 14:19:18,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749928028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101690138] [2025-03-03 14:19:18,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:18,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:18,266 INFO L87 Difference]: Start difference. First operand 1137 states and 1928 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:18,298 INFO L93 Difference]: Finished difference Result 2823 states and 4844 transitions. [2025-03-03 14:19:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:18,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-03-03 14:19:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,307 INFO L225 Difference]: With dead ends: 2823 [2025-03-03 14:19:18,307 INFO L226 Difference]: Without dead ends: 1772 [2025-03-03 14:19:18,309 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-03 14:19:18,309 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 51 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 344 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-03 14:19:18,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-03-03 14:19:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1756. [2025-03-03 14:19:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1715 states have (on average 1.7148688046647231) internal successors, (2941), 1719 states have internal predecessors, (2941), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-03-03 14:19:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2992 transitions. [2025-03-03 14:19:18,354 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2992 transitions. Word has length 94 [2025-03-03 14:19:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,355 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2992 transitions. [2025-03-03 14:19:18,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2992 transitions. [2025-03-03 14:19:18,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 14:19:18,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,359 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:18,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:19:18,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash -966482508, now seen corresponding path program 1 times [2025-03-03 14:19:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877440411] [2025-03-03 14:19:18,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 14:19:18,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 14:19:18,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:18,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877440411] [2025-03-03 14:19:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877440411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:18,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517595290] [2025-03-03 14:19:18,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:18,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:18,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:18,406 INFO L87 Difference]: Start difference. First operand 1756 states and 2992 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:18,455 INFO L93 Difference]: Finished difference Result 4447 states and 7661 transitions. [2025-03-03 14:19:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:18,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-03-03 14:19:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,467 INFO L225 Difference]: With dead ends: 4447 [2025-03-03 14:19:18,468 INFO L226 Difference]: Without dead ends: 2838 [2025-03-03 14:19:18,470 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-03 14:19:18,471 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 49 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 344 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-03 14:19:18,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2025-03-03 14:19:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2822. [2025-03-03 14:19:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2781 states have (on average 1.7130528586839266) internal successors, (4764), 2785 states have internal predecessors, (4764), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-03-03 14:19:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 4815 transitions. [2025-03-03 14:19:18,552 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 4815 transitions. Word has length 95 [2025-03-03 14:19:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,553 INFO L471 AbstractCegarLoop]: Abstraction has 2822 states and 4815 transitions. [2025-03-03 14:19:18,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 4815 transitions. [2025-03-03 14:19:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:19:18,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,558 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2025-03-03 14:19:18,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:19:18,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,558 INFO L85 PathProgramCache]: Analyzing trace with hash -602991160, now seen corresponding path program 2 times [2025-03-03 14:19:18,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501734883] [2025-03-03 14:19:18,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:19:18,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-03 14:19:18,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 51 of 96 statements. [2025-03-03 14:19:18,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:19:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:19:18,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501734883] [2025-03-03 14:19:18,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501734883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:18,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546177100] [2025-03-03 14:19:18,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:18,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:18,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:18,644 INFO L87 Difference]: Start difference. First operand 2822 states and 4815 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:18,725 INFO L93 Difference]: Finished difference Result 5129 states and 8710 transitions. [2025-03-03 14:19:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:19:18,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2025-03-03 14:19:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,743 INFO L225 Difference]: With dead ends: 5129 [2025-03-03 14:19:18,743 INFO L226 Difference]: Without dead ends: 4993 [2025-03-03 14:19:18,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:18,747 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 138 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:18,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 661 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2025-03-03 14:19:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4983. [2025-03-03 14:19:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4908 states have (on average 1.7178076609616952) internal successors, (8431), 4914 states have internal predecessors, (8431), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 8524 transitions. [2025-03-03 14:19:18,874 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 8524 transitions. Word has length 96 [2025-03-03 14:19:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,874 INFO L471 AbstractCegarLoop]: Abstraction has 4983 states and 8524 transitions. [2025-03-03 14:19:18,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 8524 transitions. [2025-03-03 14:19:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:19:18,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,885 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2025-03-03 14:19:18,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:19:18,885 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1874107579, now seen corresponding path program 1 times [2025-03-03 14:19:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514650772] [2025-03-03 14:19:18,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:19:18,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:19:18,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:19:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514650772] [2025-03-03 14:19:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514650772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:18,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954429495] [2025-03-03 14:19:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:18,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:18,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:18,976 INFO L87 Difference]: Start difference. First operand 4983 states and 8524 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:19,058 INFO L93 Difference]: Finished difference Result 9046 states and 15546 transitions. [2025-03-03 14:19:19,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:19,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2025-03-03 14:19:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:19,076 INFO L225 Difference]: With dead ends: 9046 [2025-03-03 14:19:19,076 INFO L226 Difference]: Without dead ends: 5015 [2025-03-03 14:19:19,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 14:19:19,084 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 56 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:19,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 862 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5015 states. [2025-03-03 14:19:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5015 to 4983. [2025-03-03 14:19:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4908 states have (on average 1.7031377343113285) internal successors, (8359), 4914 states have internal predecessors, (8359), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 8452 transitions. [2025-03-03 14:19:19,239 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 8452 transitions. Word has length 97 [2025-03-03 14:19:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:19,240 INFO L471 AbstractCegarLoop]: Abstraction has 4983 states and 8452 transitions. [2025-03-03 14:19:19,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 8452 transitions. [2025-03-03 14:19:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:19:19,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:19,251 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:19,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:19:19,252 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:19,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:19,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1164132750, now seen corresponding path program 1 times [2025-03-03 14:19:19,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:19,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690340124] [2025-03-03 14:19:19,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:19,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:19,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:19:19,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:19:19,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:19,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:19,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690340124] [2025-03-03 14:19:19,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690340124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:19,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:19,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035952168] [2025-03-03 14:19:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:19,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:19,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:19,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:19,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:19,326 INFO L87 Difference]: Start difference. First operand 4983 states and 8452 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:19,424 INFO L93 Difference]: Finished difference Result 12223 states and 21131 transitions. [2025-03-03 14:19:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:19,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2025-03-03 14:19:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:19,452 INFO L225 Difference]: With dead ends: 12223 [2025-03-03 14:19:19,452 INFO L226 Difference]: Without dead ends: 8029 [2025-03-03 14:19:19,461 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-03 14:19:19,462 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 47 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 336 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-03 14:19:19,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 336 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8029 states. [2025-03-03 14:19:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8029 to 7997. [2025-03-03 14:19:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7997 states, 7922 states have (on average 1.717369351173946) internal successors, (13605), 7928 states have internal predecessors, (13605), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 13698 transitions. [2025-03-03 14:19:19,694 INFO L78 Accepts]: Start accepts. Automaton has 7997 states and 13698 transitions. Word has length 97 [2025-03-03 14:19:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:19,694 INFO L471 AbstractCegarLoop]: Abstraction has 7997 states and 13698 transitions. [2025-03-03 14:19:19,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 7997 states and 13698 transitions. [2025-03-03 14:19:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:19:19,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:19,709 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:19,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:19:19,709 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:19,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 84837646, now seen corresponding path program 1 times [2025-03-03 14:19:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:19,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13160339] [2025-03-03 14:19:19,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:19,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:19:19,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:19:19,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:19,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13160339] [2025-03-03 14:19:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13160339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:19,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66021172] [2025-03-03 14:19:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:19,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:19,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:19,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:19,757 INFO L87 Difference]: Start difference. First operand 7997 states and 13698 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:19,909 INFO L93 Difference]: Finished difference Result 21373 states and 36933 transitions. [2025-03-03 14:19:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:19,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-03-03 14:19:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:19,944 INFO L225 Difference]: With dead ends: 21373 [2025-03-03 14:19:19,944 INFO L226 Difference]: Without dead ends: 14224 [2025-03-03 14:19:19,995 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-03 14:19:19,996 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 45 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 344 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-03 14:19:19,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14224 states. [2025-03-03 14:19:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14224 to 14192. [2025-03-03 14:19:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14192 states, 14117 states have (on average 1.7030530565984274) internal successors, (24042), 14123 states have internal predecessors, (24042), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14192 states to 14192 states and 24135 transitions. [2025-03-03 14:19:20,373 INFO L78 Accepts]: Start accepts. Automaton has 14192 states and 24135 transitions. Word has length 98 [2025-03-03 14:19:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:20,374 INFO L471 AbstractCegarLoop]: Abstraction has 14192 states and 24135 transitions. [2025-03-03 14:19:20,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14192 states and 24135 transitions. [2025-03-03 14:19:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:19:20,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:20,391 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:20,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:19:20,392 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:20,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2049327821, now seen corresponding path program 1 times [2025-03-03 14:19:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:20,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223640851] [2025-03-03 14:19:20,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:20,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:19:20,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:19:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:20,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:20,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223640851] [2025-03-03 14:19:20,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223640851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:20,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:20,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:20,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718411731] [2025-03-03 14:19:20,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:20,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:20,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:20,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:20,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:20,439 INFO L87 Difference]: Start difference. First operand 14192 states and 24135 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:20,821 INFO L93 Difference]: Finished difference Result 38909 states and 66628 transitions. [2025-03-03 14:19:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2025-03-03 14:19:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:20,897 INFO L225 Difference]: With dead ends: 38909 [2025-03-03 14:19:20,898 INFO L226 Difference]: Without dead ends: 25976 [2025-03-03 14:19:20,925 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-03 14:19:20,926 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 43 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 344 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-03 14:19:20,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25976 states. [2025-03-03 14:19:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25976 to 25944. [2025-03-03 14:19:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25944 states, 25869 states have (on average 1.685917507441339) internal successors, (43613), 25875 states have internal predecessors, (43613), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25944 states to 25944 states and 43706 transitions. [2025-03-03 14:19:21,617 INFO L78 Accepts]: Start accepts. Automaton has 25944 states and 43706 transitions. Word has length 99 [2025-03-03 14:19:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:21,617 INFO L471 AbstractCegarLoop]: Abstraction has 25944 states and 43706 transitions. [2025-03-03 14:19:21,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 25944 states and 43706 transitions. [2025-03-03 14:19:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:19:21,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:21,649 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:21,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:19:21,649 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:21,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash 483836717, now seen corresponding path program 1 times [2025-03-03 14:19:21,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:21,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046640204] [2025-03-03 14:19:21,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:21,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:21,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:19:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:19:21,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:21,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:19:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046640204] [2025-03-03 14:19:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046640204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:21,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:21,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:21,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106877687] [2025-03-03 14:19:21,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:21,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:21,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:21,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:21,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:21,726 INFO L87 Difference]: Start difference. First operand 25944 states and 43706 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:22,103 INFO L93 Difference]: Finished difference Result 49818 states and 84272 transitions. [2025-03-03 14:19:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2025-03-03 14:19:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:22,185 INFO L225 Difference]: With dead ends: 49818 [2025-03-03 14:19:22,185 INFO L226 Difference]: Without dead ends: 25976 [2025-03-03 14:19:22,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 14:19:22,224 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 55 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:22,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 862 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25976 states. [2025-03-03 14:19:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25976 to 25944. [2025-03-03 14:19:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25944 states, 25869 states have (on average 1.6657002589972554) internal successors, (43090), 25875 states have internal predecessors, (43090), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25944 states to 25944 states and 43183 transitions. [2025-03-03 14:19:22,841 INFO L78 Accepts]: Start accepts. Automaton has 25944 states and 43183 transitions. Word has length 100 [2025-03-03 14:19:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:22,842 INFO L471 AbstractCegarLoop]: Abstraction has 25944 states and 43183 transitions. [2025-03-03 14:19:22,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 25944 states and 43183 transitions. [2025-03-03 14:19:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:19:22,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:22,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:22,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:19:22,870 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:22,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:22,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2001727373, now seen corresponding path program 1 times [2025-03-03 14:19:22,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354015882] [2025-03-03 14:19:22,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:22,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:19:22,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:19:22,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:22,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354015882] [2025-03-03 14:19:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354015882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:22,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:22,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265430586] [2025-03-03 14:19:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:22,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:22,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:22,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:22,981 INFO L87 Difference]: Start difference. First operand 25944 states and 43183 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:23,537 INFO L93 Difference]: Finished difference Result 72718 states and 121492 transitions. [2025-03-03 14:19:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2025-03-03 14:19:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:23,672 INFO L225 Difference]: With dead ends: 72718 [2025-03-03 14:19:23,672 INFO L226 Difference]: Without dead ends: 48535 [2025-03-03 14:19:23,717 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-03 14:19:23,718 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 344 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-03 14:19:23,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48535 states. [2025-03-03 14:19:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48535 to 48503. [2025-03-03 14:19:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48503 states, 48428 states have (on average 1.6436978607417196) internal successors, (79601), 48434 states have internal predecessors, (79601), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48503 states to 48503 states and 79694 transitions. [2025-03-03 14:19:24,824 INFO L78 Accepts]: Start accepts. Automaton has 48503 states and 79694 transitions. Word has length 100 [2025-03-03 14:19:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:24,824 INFO L471 AbstractCegarLoop]: Abstraction has 48503 states and 79694 transitions. [2025-03-03 14:19:24,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 48503 states and 79694 transitions. [2025-03-03 14:19:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:19:24,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:24,870 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:24,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:19:24,871 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:24,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1148962164, now seen corresponding path program 1 times [2025-03-03 14:19:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501986612] [2025-03-03 14:19:24,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:24,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:19:24,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:19:24,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:24,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501986612] [2025-03-03 14:19:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501986612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:24,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033405226] [2025-03-03 14:19:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:24,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:24,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:24,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:24,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:24,924 INFO L87 Difference]: Start difference. First operand 48503 states and 79694 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:25,791 INFO L93 Difference]: Finished difference Result 138284 states and 227521 transitions. [2025-03-03 14:19:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2025-03-03 14:19:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:26,053 INFO L225 Difference]: With dead ends: 138284 [2025-03-03 14:19:26,053 INFO L226 Difference]: Without dead ends: 92143 [2025-03-03 14:19:26,099 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-03 14:19:26,100 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 39 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 344 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-03 14:19:26,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92143 states. [2025-03-03 14:19:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92143 to 92111. [2025-03-03 14:19:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92111 states, 92036 states have (on average 1.6181059585379634) internal successors, (148924), 92042 states have internal predecessors, (148924), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92111 states to 92111 states and 149017 transitions. [2025-03-03 14:19:28,091 INFO L78 Accepts]: Start accepts. Automaton has 92111 states and 149017 transitions. Word has length 101 [2025-03-03 14:19:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:28,092 INFO L471 AbstractCegarLoop]: Abstraction has 92111 states and 149017 transitions. [2025-03-03 14:19:28,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 92111 states and 149017 transitions. [2025-03-03 14:19:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:19:28,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:28,145 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:28,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:19:28,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:28,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1487863177, now seen corresponding path program 1 times [2025-03-03 14:19:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215798763] [2025-03-03 14:19:28,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:28,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:19:28,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:19:28,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:28,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:19:28,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:28,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215798763] [2025-03-03 14:19:28,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215798763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:28,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:28,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309069367] [2025-03-03 14:19:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:28,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:28,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:28,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:28,243 INFO L87 Difference]: Start difference. First operand 92111 states and 149017 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:29,345 INFO L93 Difference]: Finished difference Result 181115 states and 293623 transitions. [2025-03-03 14:19:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:29,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2025-03-03 14:19:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:29,593 INFO L225 Difference]: With dead ends: 181115 [2025-03-03 14:19:29,593 INFO L226 Difference]: Without dead ends: 92143 [2025-03-03 14:19:29,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 14:19:29,668 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 54 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:29,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 840 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92143 states. [2025-03-03 14:19:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92143 to 92111. [2025-03-03 14:19:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92111 states, 92036 states have (on average 1.595712547264114) internal successors, (146863), 92042 states have internal predecessors, (146863), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92111 states to 92111 states and 146956 transitions. [2025-03-03 14:19:31,641 INFO L78 Accepts]: Start accepts. Automaton has 92111 states and 146956 transitions. Word has length 102 [2025-03-03 14:19:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:31,641 INFO L471 AbstractCegarLoop]: Abstraction has 92111 states and 146956 transitions. [2025-03-03 14:19:31,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 92111 states and 146956 transitions. [2025-03-03 14:19:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:19:31,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:31,701 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:31,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:19:31,702 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:31,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 628267148, now seen corresponding path program 1 times [2025-03-03 14:19:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899139582] [2025-03-03 14:19:31,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:31,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:31,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:19:31,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:19:31,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:31,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:31,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:31,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899139582] [2025-03-03 14:19:31,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899139582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:31,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:31,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856717513] [2025-03-03 14:19:31,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:31,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:31,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:31,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:31,754 INFO L87 Difference]: Start difference. First operand 92111 states and 146956 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:33,139 INFO L93 Difference]: Finished difference Result 175900 states and 279726 transitions. [2025-03-03 14:19:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:33,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2025-03-03 14:19:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:33,496 INFO L225 Difference]: With dead ends: 175900 [2025-03-03 14:19:33,496 INFO L226 Difference]: Without dead ends: 175598 [2025-03-03 14:19:33,555 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-03 14:19:33,556 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 35 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 353 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-03 14:19:33,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 353 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175598 states. [2025-03-03 14:19:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175598 to 175566. [2025-03-03 14:19:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175566 states, 175491 states have (on average 1.5670205309674001) internal successors, (274998), 175497 states have internal predecessors, (274998), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:19:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175566 states to 175566 states and 275091 transitions. [2025-03-03 14:19:37,165 INFO L78 Accepts]: Start accepts. Automaton has 175566 states and 275091 transitions. Word has length 102 [2025-03-03 14:19:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:37,166 INFO L471 AbstractCegarLoop]: Abstraction has 175566 states and 275091 transitions. [2025-03-03 14:19:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:19:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 175566 states and 275091 transitions. [2025-03-03 14:19:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:19:37,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:37,224 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:37,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:19:37,224 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:37,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1460724629, now seen corresponding path program 1 times [2025-03-03 14:19:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:37,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506827992] [2025-03-03 14:19:37,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:37,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:19:37,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:19:37,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:37,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:19:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506827992] [2025-03-03 14:19:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506827992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:37,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203826855] [2025-03-03 14:19:37,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:37,514 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-03 14:19:37,519 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-03 14:19:37,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:19:37,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:19:37,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:37,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:37,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:19:37,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:19:38,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:38,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203826855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:38,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:38,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2025-03-03 14:19:38,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619929840] [2025-03-03 14:19:38,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:38,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:38,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:19:38,407 INFO L87 Difference]: Start difference. First operand 175566 states and 275091 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-03 14:19:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:40,590 INFO L93 Difference]: Finished difference Result 176189 states and 275912 transitions. [2025-03-03 14:19:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:19:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 103 [2025-03-03 14:19:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:41,001 INFO L225 Difference]: With dead ends: 176189 [2025-03-03 14:19:41,001 INFO L226 Difference]: Without dead ends: 175911 [2025-03-03 14:19:41,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:19:41,039 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 364 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:41,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1734 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:19:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175911 states. [2025-03-03 14:19:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175911 to 175866. [2025-03-03 14:19:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175866 states, 175731 states have (on average 1.566655854686993) internal successors, (275310), 175741 states have internal predecessors, (275310), 75 states have call successors, (75), 45 states have call predecessors, (75), 59 states have return successors, (98), 79 states have call predecessors, (98), 67 states have call successors, (98) [2025-03-03 14:19:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175866 states to 175866 states and 275483 transitions. [2025-03-03 14:19:44,621 INFO L78 Accepts]: Start accepts. Automaton has 175866 states and 275483 transitions. Word has length 103 [2025-03-03 14:19:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:44,622 INFO L471 AbstractCegarLoop]: Abstraction has 175866 states and 275483 transitions. [2025-03-03 14:19:44,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-03 14:19:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 175866 states and 275483 transitions. [2025-03-03 14:19:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:19:44,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:44,688 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:44,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:19:44,888 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,SelfDestructingSolverStorable22 [2025-03-03 14:19:44,889 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:44,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1978475850, now seen corresponding path program 1 times [2025-03-03 14:19:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:44,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506852527] [2025-03-03 14:19:44,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:44,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:19:44,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:19:44,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:44,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 14:19:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:45,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506852527] [2025-03-03 14:19:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506852527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:45,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:19:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784870035] [2025-03-03 14:19:45,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:45,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:19:45,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:45,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:19:45,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:45,271 INFO L87 Difference]: Start difference. First operand 175866 states and 275483 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-03 14:19:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:46,988 INFO L93 Difference]: Finished difference Result 176620 states and 276483 transitions. [2025-03-03 14:19:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:19:46,988 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 104 [2025-03-03 14:19:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:47,443 INFO L225 Difference]: With dead ends: 176620 [2025-03-03 14:19:47,444 INFO L226 Difference]: Without dead ends: 175881 [2025-03-03 14:19:47,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:19:47,509 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 52 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:47,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1480 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175881 states. [2025-03-03 14:19:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175881 to 175852. [2025-03-03 14:19:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175852 states, 175716 states have (on average 1.566596098249448) internal successors, (275276), 175725 states have internal predecessors, (275276), 83 states have call successors, (83), 44 states have call predecessors, (83), 52 states have return successors, (103), 82 states have call predecessors, (103), 76 states have call successors, (103) [2025-03-03 14:19:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175852 states to 175852 states and 275462 transitions. [2025-03-03 14:19:51,108 INFO L78 Accepts]: Start accepts. Automaton has 175852 states and 275462 transitions. Word has length 104 [2025-03-03 14:19:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:51,109 INFO L471 AbstractCegarLoop]: Abstraction has 175852 states and 275462 transitions. [2025-03-03 14:19:51,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-03 14:19:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 175852 states and 275462 transitions. [2025-03-03 14:19:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:19:51,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:51,190 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:51,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:19:51,191 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:51,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:51,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1087938237, now seen corresponding path program 1 times [2025-03-03 14:19:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:51,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453502013] [2025-03-03 14:19:51,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:51,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:51,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:19:51,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:19:51,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:51,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat