./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product10.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec11_product10.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 c9a35f77051831a79054d5620e487d68dd21285b0cc9c8ae29c469f997bd1ec7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:30:11,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:30:11,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:30:11,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:30:11,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:30:11,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:30:11,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:30:11,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:30:11,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:30:11,556 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:30:11,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:30:11,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:30:11,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:30:11,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:30:11,557 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:30:11,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:30:11,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:30:11,558 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:30:11,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:30:11,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:30:11,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:30:11,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:30:11,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:30:11,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:30:11,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:30:11,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:30:11,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:30:11,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:30:11,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:30:11,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:30:11,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:30:11,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:30:11,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:30:11,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:30:11,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:30:11,561 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 -> c9a35f77051831a79054d5620e487d68dd21285b0cc9c8ae29c469f997bd1ec7 [2025-03-08 05:30:11,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:30:11,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:30:11,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:30:11,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:30:11,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:30:11,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product10.cil.c [2025-03-08 05:30:12,991 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb166a6f0/ca250557f32e487cbf6528b672a2eec9/FLAG2e73bf448 [2025-03-08 05:30:13,347 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:30:13,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product10.cil.c [2025-03-08 05:30:13,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb166a6f0/ca250557f32e487cbf6528b672a2eec9/FLAG2e73bf448 [2025-03-08 05:30:13,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb166a6f0/ca250557f32e487cbf6528b672a2eec9 [2025-03-08 05:30:13,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:30:13,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:30:13,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:30:13,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:30:13,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:30:13,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:13" (1/1) ... [2025-03-08 05:30:13,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bb4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:13, skipping insertion in model container [2025-03-08 05:30:13,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:13" (1/1) ... [2025-03-08 05:30:13,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:30:14,000 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_spec11_product10.cil.c[53446,53459] [2025-03-08 05:30:14,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:30:14,044 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:30:14,052 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-08 05:30:14,053 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [460] [2025-03-08 05:30:14,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [478] [2025-03-08 05:30:14,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1558] [2025-03-08 05:30:14,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1769] [2025-03-08 05:30:14,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1967] [2025-03-08 05:30:14,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [2333] [2025-03-08 05:30:14,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2354] [2025-03-08 05:30:14,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2363] [2025-03-08 05:30:14,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2504] [2025-03-08 05:30:14,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2567] [2025-03-08 05:30:14,143 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_spec11_product10.cil.c[53446,53459] [2025-03-08 05:30:14,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:30:14,177 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:30:14,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14 WrapperNode [2025-03-08 05:30:14,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:30:14,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:30:14,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:30:14,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:30:14,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,231 INFO L138 Inliner]: procedures = 110, calls = 121, calls flagged for inlining = 40, calls inlined = 33, statements flattened = 622 [2025-03-08 05:30:14,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:30:14,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:30:14,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:30:14,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:30:14,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,256 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-08 05:30:14,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:30:14,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:30:14,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:30:14,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:30:14,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (1/1) ... [2025-03-08 05:30:14,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:30:14,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:14,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:30:14,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:30:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:30:14,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:30:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:30:14,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:30:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:30:14,329 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:30:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:30:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:30:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:30:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:30:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:30:14,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:30:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:30:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:30:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:30:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:30:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:30:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:30:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:30:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:30:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:30:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:30:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:30:14,466 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:30:14,468 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:30:14,649 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1535-1: getClientId_#res#1 := getClientId_~retValue_acc~28#1; [2025-03-08 05:30:14,650 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1053-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~20#1; [2025-03-08 05:30:14,651 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-08 05:30:14,651 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1488-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~27#1; [2025-03-08 05:30:14,668 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-08 05:30:14,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2564-1: createEmail_#res#1 := createEmail_~retValue_acc~39#1; [2025-03-08 05:30:14,878 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1715-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~30#1; [2025-03-08 05:30:14,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2599-1: valid_product_#res#1 := valid_product_~retValue_acc~41#1; [2025-03-08 05:30:14,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~31#1; [2025-03-08 05:30:14,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1733-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~32#1; [2025-03-08 05:30:14,884 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-08 05:30:14,888 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2540: #res := ~retValue_acc~37; [2025-03-08 05:30:14,951 INFO L? ?]: Removed 197 outVars from TransFormulas that were not future-live. [2025-03-08 05:30:14,951 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:30:14,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:30:14,965 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:30:14,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:14 BoogieIcfgContainer [2025-03-08 05:30:14,966 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:30:14,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:30:14,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:30:14,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:30:14,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:30:13" (1/3) ... [2025-03-08 05:30:14,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ea4813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:14, skipping insertion in model container [2025-03-08 05:30:14,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:14" (2/3) ... [2025-03-08 05:30:14,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ea4813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:14, skipping insertion in model container [2025-03-08 05:30:14,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:14" (3/3) ... [2025-03-08 05:30:14,974 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product10.cil.c [2025-03-08 05:30:14,987 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:30:14,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product10.cil.c that has 10 procedures, 152 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:30:15,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:30:15,079 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;@478863bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:30:15,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:30:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 122 states have (on average 1.4754098360655739) internal successors, (180), 124 states have internal predecessors, (180), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 05:30:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:30:15,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:15,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:15,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash 877903642, now seen corresponding path program 1 times [2025-03-08 05:30:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:15,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556214882] [2025-03-08 05:30:15,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:15,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:30:15,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:30:15,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:15,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:30:15,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:15,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556214882] [2025-03-08 05:30:15,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556214882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:15,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931084425] [2025-03-08 05:30:15,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:15,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:15,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:15,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:15,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:30:15,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:30:15,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:30:15,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:15,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:15,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:30:15,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:30:15,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931084425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:30:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491532619] [2025-03-08 05:30:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:15,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:15,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:15,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:15,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:30:15,837 INFO L87 Difference]: Start difference. First operand has 152 states, 122 states have (on average 1.4754098360655739) internal successors, (180), 124 states have internal predecessors, (180), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:15,888 INFO L93 Difference]: Finished difference Result 252 states and 353 transitions. [2025-03-08 05:30:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:15,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-03-08 05:30:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:15,895 INFO L225 Difference]: With dead ends: 252 [2025-03-08 05:30:15,895 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 05:30:15,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:30:15,900 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:15,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 05:30:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-08 05:30:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.4615384615384615) internal successors, (171), 118 states have internal predecessors, (171), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 05:30:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2025-03-08 05:30:15,930 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 208 transitions. Word has length 69 [2025-03-08 05:30:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:15,930 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 208 transitions. [2025-03-08 05:30:15,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 208 transitions. [2025-03-08 05:30:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:30:15,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:15,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:15,941 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-08 05:30:16,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:30:16,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash -879973191, now seen corresponding path program 1 times [2025-03-08 05:30:16,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:16,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322054572] [2025-03-08 05:30:16,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:16,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:30:16,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:30:16,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:16,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:30:16,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322054572] [2025-03-08 05:30:16,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322054572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181638556] [2025-03-08 05:30:16,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:16,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:16,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:16,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:30:16,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:30:16,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:30:16,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:16,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:16,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:30:16,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:30:16,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181638556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:16,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:16,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:30:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271636769] [2025-03-08 05:30:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:16,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:16,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:16,584 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:30:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:16,644 INFO L93 Difference]: Finished difference Result 285 states and 409 transitions. [2025-03-08 05:30:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:16,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2025-03-08 05:30:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:16,648 INFO L225 Difference]: With dead ends: 285 [2025-03-08 05:30:16,648 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 05:30:16,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:16,649 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 2 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:16,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 785 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 05:30:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-08 05:30:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 120 states have internal predecessors, (172), 19 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2025-03-08 05:30:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 211 transitions. [2025-03-08 05:30:16,660 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 211 transitions. Word has length 72 [2025-03-08 05:30:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:16,660 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 211 transitions. [2025-03-08 05:30:16,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:30:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 211 transitions. [2025-03-08 05:30:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 05:30:16,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:16,662 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:16,669 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-08 05:30:16,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:30:16,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:16,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash 233734027, now seen corresponding path program 1 times [2025-03-08 05:30:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:16,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172097548] [2025-03-08 05:30:16,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:16,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:16,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 05:30:16,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 05:30:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:16,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:30:17,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:17,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172097548] [2025-03-08 05:30:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172097548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:17,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:17,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682327455] [2025-03-08 05:30:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:17,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:17,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:17,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:17,036 INFO L87 Difference]: Start difference. First operand 148 states and 211 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:30:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:17,076 INFO L93 Difference]: Finished difference Result 277 states and 397 transitions. [2025-03-08 05:30:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:17,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2025-03-08 05:30:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:17,079 INFO L225 Difference]: With dead ends: 277 [2025-03-08 05:30:17,079 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 05:30:17,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:17,083 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 2 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:17,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 789 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 05:30:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-08 05:30:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 120 states have internal predecessors, (172), 19 states have call successors, (19), 9 states have call predecessors, (19), 10 states have return successors, (19), 18 states have call predecessors, (19), 18 states have call successors, (19) [2025-03-08 05:30:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 210 transitions. [2025-03-08 05:30:17,096 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 210 transitions. Word has length 73 [2025-03-08 05:30:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:17,097 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 210 transitions. [2025-03-08 05:30:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:30:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 210 transitions. [2025-03-08 05:30:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:30:17,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:17,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:17,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:30:17,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:17,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1606377885, now seen corresponding path program 2 times [2025-03-08 05:30:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841851104] [2025-03-08 05:30:17,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:30:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:17,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-08 05:30:17,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 74 statements. [2025-03-08 05:30:17,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:30:17,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:30:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841851104] [2025-03-08 05:30:17,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841851104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:17,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:17,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105773441] [2025-03-08 05:30:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:17,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:17,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:17,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:17,245 INFO L87 Difference]: Start difference. First operand 148 states and 210 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:17,293 INFO L93 Difference]: Finished difference Result 361 states and 507 transitions. [2025-03-08 05:30:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:17,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-08 05:30:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:17,297 INFO L225 Difference]: With dead ends: 361 [2025-03-08 05:30:17,298 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 05:30:17,298 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-08 05:30:17,300 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 174 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:17,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 792 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 05:30:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2025-03-08 05:30:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 220 states have (on average 1.4772727272727273) internal successors, (325), 223 states have internal predecessors, (325), 35 states have call successors, (35), 17 states have call predecessors, (35), 18 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 05:30:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 394 transitions. [2025-03-08 05:30:17,330 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 394 transitions. Word has length 74 [2025-03-08 05:30:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:17,332 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 394 transitions. [2025-03-08 05:30:17,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 394 transitions. [2025-03-08 05:30:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:30:17,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:17,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:17,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:30:17,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:17,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:17,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1010689769, now seen corresponding path program 1 times [2025-03-08 05:30:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:17,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905603445] [2025-03-08 05:30:17,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:17,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:17,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:30:17,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:30:17,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:17,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:30:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:17,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905603445] [2025-03-08 05:30:17,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905603445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:17,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:17,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149927355] [2025-03-08 05:30:17,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:17,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:17,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:17,494 INFO L87 Difference]: Start difference. First operand 274 states and 394 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:30:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:17,538 INFO L93 Difference]: Finished difference Result 531 states and 768 transitions. [2025-03-08 05:30:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:17,539 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-08 05:30:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:17,541 INFO L225 Difference]: With dead ends: 531 [2025-03-08 05:30:17,541 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 05:30:17,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:17,542 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:17,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 792 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 05:30:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-08 05:30:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 225 states have internal predecessors, (326), 35 states have call successors, (35), 17 states have call predecessors, (35), 19 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2025-03-08 05:30:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 397 transitions. [2025-03-08 05:30:17,566 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 397 transitions. Word has length 75 [2025-03-08 05:30:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:17,566 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 397 transitions. [2025-03-08 05:30:17,566 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:30:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 397 transitions. [2025-03-08 05:30:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:30:17,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:17,567 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:17,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:30:17,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:17,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1661703730, now seen corresponding path program 1 times [2025-03-08 05:30:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630045459] [2025-03-08 05:30:17,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:17,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:30:17,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:30:17,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:17,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:17,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:17,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630045459] [2025-03-08 05:30:17,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630045459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:17,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070818647] [2025-03-08 05:30:17,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:17,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:17,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:17,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:17,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:30:17,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:30:17,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:30:17,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:17,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:17,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:17,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:17,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:30:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070818647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:30:17,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:30:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:30:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378878453] [2025-03-08 05:30:17,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:30:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:30:17,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:17,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:30:17,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:17,938 INFO L87 Difference]: Start difference. First operand 276 states and 397 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:30:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:17,995 INFO L93 Difference]: Finished difference Result 670 states and 999 transitions. [2025-03-08 05:30:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:30:17,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 76 [2025-03-08 05:30:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:17,998 INFO L225 Difference]: With dead ends: 670 [2025-03-08 05:30:17,999 INFO L226 Difference]: Without dead ends: 484 [2025-03-08 05:30:18,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:30:18,001 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 194 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:18,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1099 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-08 05:30:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 444. [2025-03-08 05:30:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 389 states have (on average 1.6298200514138816) internal successors, (634), 393 states have internal predecessors, (634), 35 states have call successors, (35), 17 states have call predecessors, (35), 19 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2025-03-08 05:30:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 705 transitions. [2025-03-08 05:30:18,031 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 705 transitions. Word has length 76 [2025-03-08 05:30:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:18,031 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 705 transitions. [2025-03-08 05:30:18,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:30:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 705 transitions. [2025-03-08 05:30:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:30:18,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:18,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:18,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:18,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:18,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:18,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2097784474, now seen corresponding path program 1 times [2025-03-08 05:30:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671443622] [2025-03-08 05:30:18,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:18,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:30:18,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:30:18,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:18,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:18,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671443622] [2025-03-08 05:30:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671443622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991370709] [2025-03-08 05:30:18,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:18,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:18,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:18,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,294 INFO L87 Difference]: Start difference. First operand 444 states and 705 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:18,319 INFO L93 Difference]: Finished difference Result 1042 states and 1695 transitions. [2025-03-08 05:30:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:18,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2025-03-08 05:30:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:18,325 INFO L225 Difference]: With dead ends: 1042 [2025-03-08 05:30:18,325 INFO L226 Difference]: Without dead ends: 624 [2025-03-08 05:30:18,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,329 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 65 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:18,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 420 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-08 05:30:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 608. [2025-03-08 05:30:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 553 states have (on average 1.678119349005425) internal successors, (928), 557 states have internal predecessors, (928), 35 states have call successors, (35), 17 states have call predecessors, (35), 19 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2025-03-08 05:30:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 999 transitions. [2025-03-08 05:30:18,355 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 999 transitions. Word has length 84 [2025-03-08 05:30:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:18,355 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 999 transitions. [2025-03-08 05:30:18,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 999 transitions. [2025-03-08 05:30:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:30:18,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:18,356 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:18,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:30:18,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:18,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:18,357 INFO L85 PathProgramCache]: Analyzing trace with hash -343189905, now seen corresponding path program 2 times [2025-03-08 05:30:18,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:18,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784654078] [2025-03-08 05:30:18,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:30:18,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:18,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-08 05:30:18,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 85 statements. [2025-03-08 05:30:18,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:30:18,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:18,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:18,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784654078] [2025-03-08 05:30:18,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784654078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:18,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:18,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:18,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103419849] [2025-03-08 05:30:18,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:18,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:18,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:18,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:18,429 INFO L87 Difference]: Start difference. First operand 608 states and 999 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:18,471 INFO L93 Difference]: Finished difference Result 1241 states and 1964 transitions. [2025-03-08 05:30:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:18,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-03-08 05:30:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:18,476 INFO L225 Difference]: With dead ends: 1241 [2025-03-08 05:30:18,476 INFO L226 Difference]: Without dead ends: 1071 [2025-03-08 05:30:18,478 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-08 05:30:18,478 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 171 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:18,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 789 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-08 05:30:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1067. [2025-03-08 05:30:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 964 states have (on average 1.6628630705394192) internal successors, (1603), 970 states have internal predecessors, (1603), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1736 transitions. [2025-03-08 05:30:18,537 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1736 transitions. Word has length 85 [2025-03-08 05:30:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:18,537 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1736 transitions. [2025-03-08 05:30:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1736 transitions. [2025-03-08 05:30:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:30:18,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:18,543 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:18,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:30:18,543 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:18,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash 196291718, now seen corresponding path program 1 times [2025-03-08 05:30:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420788637] [2025-03-08 05:30:18,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:18,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:30:18,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:30:18,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:18,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:30:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420788637] [2025-03-08 05:30:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420788637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:18,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:18,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565338187] [2025-03-08 05:30:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:18,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:18,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:18,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:18,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,615 INFO L87 Difference]: Start difference. First operand 1067 states and 1736 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:18,648 INFO L93 Difference]: Finished difference Result 1910 states and 3057 transitions. [2025-03-08 05:30:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:18,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-03-08 05:30:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:18,655 INFO L225 Difference]: With dead ends: 1910 [2025-03-08 05:30:18,655 INFO L226 Difference]: Without dead ends: 1099 [2025-03-08 05:30:18,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,659 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 64 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:18,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 477 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-08 05:30:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1067. [2025-03-08 05:30:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 964 states have (on average 1.654564315352697) internal successors, (1595), 970 states have internal predecessors, (1595), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1728 transitions. [2025-03-08 05:30:18,707 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1728 transitions. Word has length 86 [2025-03-08 05:30:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:18,707 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1728 transitions. [2025-03-08 05:30:18,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1728 transitions. [2025-03-08 05:30:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:30:18,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:18,709 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:18,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:30:18,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:18,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1025843509, now seen corresponding path program 1 times [2025-03-08 05:30:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:18,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537786335] [2025-03-08 05:30:18,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:18,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:30:18,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:30:18,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:18,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:18,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537786335] [2025-03-08 05:30:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537786335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695816593] [2025-03-08 05:30:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:18,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:18,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:18,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,763 INFO L87 Difference]: Start difference. First operand 1067 states and 1728 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:18,800 INFO L93 Difference]: Finished difference Result 2426 states and 4009 transitions. [2025-03-08 05:30:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:18,802 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-03-08 05:30:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:18,811 INFO L225 Difference]: With dead ends: 2426 [2025-03-08 05:30:18,811 INFO L226 Difference]: Without dead ends: 1567 [2025-03-08 05:30:18,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,814 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 63 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:18,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 401 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-03-08 05:30:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1535. [2025-03-08 05:30:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1432 states have (on average 1.714385474860335) internal successors, (2455), 1438 states have internal predecessors, (2455), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2588 transitions. [2025-03-08 05:30:18,862 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2588 transitions. Word has length 86 [2025-03-08 05:30:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:18,863 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2588 transitions. [2025-03-08 05:30:18,863 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2588 transitions. [2025-03-08 05:30:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:30:18,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:18,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:18,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:30:18,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:18,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash -827758962, now seen corresponding path program 1 times [2025-03-08 05:30:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008098238] [2025-03-08 05:30:18,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:18,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:30:18,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:30:18,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:18,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008098238] [2025-03-08 05:30:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008098238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:18,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:18,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:18,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247345404] [2025-03-08 05:30:18,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:18,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:18,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:18,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,928 INFO L87 Difference]: Start difference. First operand 1535 states and 2588 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:18,965 INFO L93 Difference]: Finished difference Result 3691 states and 6301 transitions. [2025-03-08 05:30:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:18,966 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2025-03-08 05:30:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:18,975 INFO L225 Difference]: With dead ends: 3691 [2025-03-08 05:30:18,975 INFO L226 Difference]: Without dead ends: 2284 [2025-03-08 05:30:18,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,979 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 61 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:18,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 409 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2025-03-08 05:30:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2252. [2025-03-08 05:30:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2149 states have (on average 1.7254536993950675) internal successors, (3708), 2155 states have internal predecessors, (3708), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3841 transitions. [2025-03-08 05:30:19,041 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3841 transitions. Word has length 87 [2025-03-08 05:30:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:19,041 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3841 transitions. [2025-03-08 05:30:19,041 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3841 transitions. [2025-03-08 05:30:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:30:19,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:19,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:19,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:30:19,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:19,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:19,047 INFO L85 PathProgramCache]: Analyzing trace with hash -390545876, now seen corresponding path program 1 times [2025-03-08 05:30:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:19,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187345363] [2025-03-08 05:30:19,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:19,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:30:19,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:30:19,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:19,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187345363] [2025-03-08 05:30:19,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187345363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:19,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:19,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:19,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448652732] [2025-03-08 05:30:19,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:19,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:19,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:19,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:19,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:19,094 INFO L87 Difference]: Start difference. First operand 2252 states and 3841 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:19,147 INFO L93 Difference]: Finished difference Result 5494 states and 9484 transitions. [2025-03-08 05:30:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:19,148 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2025-03-08 05:30:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:19,161 INFO L225 Difference]: With dead ends: 5494 [2025-03-08 05:30:19,161 INFO L226 Difference]: Without dead ends: 3483 [2025-03-08 05:30:19,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:19,167 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 59 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:19,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2025-03-08 05:30:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3451. [2025-03-08 05:30:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3348 states have (on average 1.728494623655914) internal successors, (5787), 3354 states have internal predecessors, (5787), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5920 transitions. [2025-03-08 05:30:19,291 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5920 transitions. Word has length 88 [2025-03-08 05:30:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:19,292 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 5920 transitions. [2025-03-08 05:30:19,292 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5920 transitions. [2025-03-08 05:30:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 05:30:19,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:19,300 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:19,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:30:19,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:19,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2101206125, now seen corresponding path program 1 times [2025-03-08 05:30:19,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:19,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539394474] [2025-03-08 05:30:19,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:19,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:19,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:30:19,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:30:19,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:19,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539394474] [2025-03-08 05:30:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539394474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:19,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:19,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:19,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881267382] [2025-03-08 05:30:19,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:19,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:19,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:19,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:19,348 INFO L87 Difference]: Start difference. First operand 3451 states and 5920 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:19,425 INFO L93 Difference]: Finished difference Result 8634 states and 14987 transitions. [2025-03-08 05:30:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:19,425 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 89 [2025-03-08 05:30:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:19,447 INFO L225 Difference]: With dead ends: 8634 [2025-03-08 05:30:19,448 INFO L226 Difference]: Without dead ends: 5589 [2025-03-08 05:30:19,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:19,456 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 57 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:19,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2025-03-08 05:30:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 5557. [2025-03-08 05:30:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5557 states, 5454 states have (on average 1.7268060139347268) internal successors, (9418), 5460 states have internal predecessors, (9418), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 5557 states and 9551 transitions. [2025-03-08 05:30:19,638 INFO L78 Accepts]: Start accepts. Automaton has 5557 states and 9551 transitions. Word has length 89 [2025-03-08 05:30:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 5557 states and 9551 transitions. [2025-03-08 05:30:19,639 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5557 states and 9551 transitions. [2025-03-08 05:30:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:30:19,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:19,650 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:19,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:30:19,650 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:19,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1395412749, now seen corresponding path program 1 times [2025-03-08 05:30:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:19,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989848033] [2025-03-08 05:30:19,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:19,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:30:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:30:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:19,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:19,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989848033] [2025-03-08 05:30:19,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989848033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:19,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:19,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:19,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154900530] [2025-03-08 05:30:19,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:19,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:19,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:19,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:19,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:19,698 INFO L87 Difference]: Start difference. First operand 5557 states and 9551 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:19,849 INFO L93 Difference]: Finished difference Result 13477 states and 23532 transitions. [2025-03-08 05:30:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:19,850 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2025-03-08 05:30:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:19,887 INFO L225 Difference]: With dead ends: 13477 [2025-03-08 05:30:19,888 INFO L226 Difference]: Without dead ends: 8740 [2025-03-08 05:30:19,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:19,900 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 55 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:19,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 400 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8740 states. [2025-03-08 05:30:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8740 to 8708. [2025-03-08 05:30:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8708 states, 8605 states have (on average 1.7309703660662406) internal successors, (14895), 8611 states have internal predecessors, (14895), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8708 states to 8708 states and 15028 transitions. [2025-03-08 05:30:20,166 INFO L78 Accepts]: Start accepts. Automaton has 8708 states and 15028 transitions. Word has length 90 [2025-03-08 05:30:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 8708 states and 15028 transitions. [2025-03-08 05:30:20,167 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 8708 states and 15028 transitions. [2025-03-08 05:30:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 05:30:20,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:20,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:30:20,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:20,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1289283060, now seen corresponding path program 1 times [2025-03-08 05:30:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869908579] [2025-03-08 05:30:20,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:20,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:20,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:30:20,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:30:20,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:20,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:20,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:20,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869908579] [2025-03-08 05:30:20,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869908579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:20,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:20,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373649772] [2025-03-08 05:30:20,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:20,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:20,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:20,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:20,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:20,261 INFO L87 Difference]: Start difference. First operand 8708 states and 15028 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:20,446 INFO L93 Difference]: Finished difference Result 22912 states and 39953 transitions. [2025-03-08 05:30:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 91 [2025-03-08 05:30:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:20,491 INFO L225 Difference]: With dead ends: 22912 [2025-03-08 05:30:20,491 INFO L226 Difference]: Without dead ends: 15314 [2025-03-08 05:30:20,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:20,510 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 53 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:20,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2025-03-08 05:30:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 15282. [2025-03-08 05:30:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15282 states, 15179 states have (on average 1.7213255155148561) internal successors, (26128), 15185 states have internal predecessors, (26128), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15282 states to 15282 states and 26261 transitions. [2025-03-08 05:30:20,967 INFO L78 Accepts]: Start accepts. Automaton has 15282 states and 26261 transitions. Word has length 91 [2025-03-08 05:30:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:20,967 INFO L471 AbstractCegarLoop]: Abstraction has 15282 states and 26261 transitions. [2025-03-08 05:30:20,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 15282 states and 26261 transitions. [2025-03-08 05:30:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:30:21,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:21,059 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:21,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:30:21,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:21,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 680603180, now seen corresponding path program 1 times [2025-03-08 05:30:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:21,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384047800] [2025-03-08 05:30:21,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:21,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:30:21,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:30:21,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:21,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:30:21,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:21,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384047800] [2025-03-08 05:30:21,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384047800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:21,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809188173] [2025-03-08 05:30:21,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:21,199 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:21,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:30:21,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:30:21,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:30:21,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:21,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:21,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:30:21,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:30:21,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809188173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:21,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:21,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 05:30:21,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332292683] [2025-03-08 05:30:21,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:21,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:21,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:21,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:21,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:21,411 INFO L87 Difference]: Start difference. First operand 15282 states and 26261 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:21,611 INFO L93 Difference]: Finished difference Result 28648 states and 49453 transitions. [2025-03-08 05:30:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:21,611 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2025-03-08 05:30:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:21,647 INFO L225 Difference]: With dead ends: 28648 [2025-03-08 05:30:21,648 INFO L226 Difference]: Without dead ends: 15314 [2025-03-08 05:30:21,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:21,666 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 62 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:21,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 477 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2025-03-08 05:30:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 15282. [2025-03-08 05:30:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15282 states, 15179 states have (on average 1.703669543448185) internal successors, (25860), 15185 states have internal predecessors, (25860), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15282 states to 15282 states and 25993 transitions. [2025-03-08 05:30:22,082 INFO L78 Accepts]: Start accepts. Automaton has 15282 states and 25993 transitions. Word has length 92 [2025-03-08 05:30:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:22,082 INFO L471 AbstractCegarLoop]: Abstraction has 15282 states and 25993 transitions. [2025-03-08 05:30:22,083 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 15282 states and 25993 transitions. [2025-03-08 05:30:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:30:22,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:22,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:22,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:30:22,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:30:22,312 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:22,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1009279250, now seen corresponding path program 1 times [2025-03-08 05:30:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:22,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322367620] [2025-03-08 05:30:22,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:22,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:30:22,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:30:22,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:22,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:22,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322367620] [2025-03-08 05:30:22,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322367620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:22,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:22,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122847435] [2025-03-08 05:30:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:22,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:22,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:22,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:22,369 INFO L87 Difference]: Start difference. First operand 15282 states and 25993 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:22,682 INFO L93 Difference]: Finished difference Result 41581 states and 71190 transitions. [2025-03-08 05:30:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:22,682 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2025-03-08 05:30:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:22,747 INFO L225 Difference]: With dead ends: 41581 [2025-03-08 05:30:22,747 INFO L226 Difference]: Without dead ends: 27822 [2025-03-08 05:30:22,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:22,772 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 51 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:22,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 408 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27822 states. [2025-03-08 05:30:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27822 to 27790. [2025-03-08 05:30:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27790 states, 27687 states have (on average 1.687940188536136) internal successors, (46734), 27693 states have internal predecessors, (46734), 67 states have call successors, (67), 33 states have call predecessors, (67), 35 states have return successors, (66), 63 states have call predecessors, (66), 63 states have call successors, (66) [2025-03-08 05:30:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27790 states to 27790 states and 46867 transitions. [2025-03-08 05:30:23,404 INFO L78 Accepts]: Start accepts. Automaton has 27790 states and 46867 transitions. Word has length 92 [2025-03-08 05:30:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:23,405 INFO L471 AbstractCegarLoop]: Abstraction has 27790 states and 46867 transitions. [2025-03-08 05:30:23,405 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 27790 states and 46867 transitions. [2025-03-08 05:30:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:30:23,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:23,440 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:23,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:30:23,440 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:23,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1698632547, now seen corresponding path program 1 times [2025-03-08 05:30:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:23,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89576585] [2025-03-08 05:30:23,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:23,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:30:23,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:30:23,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:23,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:30:23,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:23,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89576585] [2025-03-08 05:30:23,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89576585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:23,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714564969] [2025-03-08 05:30:23,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:23,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:23,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:23,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:23,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:30:23,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:30:23,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:30:23,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:23,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:23,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:30:23,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:23,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714564969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:23,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-08 05:30:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671175579] [2025-03-08 05:30:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:23,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:30:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:23,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:30:23,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:30:23,769 INFO L87 Difference]: Start difference. First operand 27790 states and 46867 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:30:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:24,079 INFO L93 Difference]: Finished difference Result 27802 states and 46878 transitions. [2025-03-08 05:30:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:30:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2025-03-08 05:30:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:24,112 INFO L225 Difference]: With dead ends: 27802 [2025-03-08 05:30:24,113 INFO L226 Difference]: Without dead ends: 14614 [2025-03-08 05:30:24,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:30:24,128 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 181 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:24,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 425 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14614 states. [2025-03-08 05:30:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14614 to 14610. [2025-03-08 05:30:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14610 states, 14555 states have (on average 1.6623153555479218) internal successors, (24195), 14558 states have internal predecessors, (24195), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 05:30:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14610 states to 14610 states and 24264 transitions. [2025-03-08 05:30:24,378 INFO L78 Accepts]: Start accepts. Automaton has 14610 states and 24264 transitions. Word has length 93 [2025-03-08 05:30:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:24,379 INFO L471 AbstractCegarLoop]: Abstraction has 14610 states and 24264 transitions. [2025-03-08 05:30:24,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:30:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14610 states and 24264 transitions. [2025-03-08 05:30:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:30:24,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:24,398 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:24,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:24,599 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,SelfDestructingSolverStorable17 [2025-03-08 05:30:24,600 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:24,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1473228651, now seen corresponding path program 1 times [2025-03-08 05:30:24,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:24,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8785531] [2025-03-08 05:30:24,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:24,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:24,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:30:24,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:30:24,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:24,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:24,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:24,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8785531] [2025-03-08 05:30:24,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8785531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:24,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:24,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446263653] [2025-03-08 05:30:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:24,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:24,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:24,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:24,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:24,644 INFO L87 Difference]: Start difference. First operand 14610 states and 24264 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:24,983 INFO L93 Difference]: Finished difference Result 39960 states and 66695 transitions. [2025-03-08 05:30:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:24,983 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2025-03-08 05:30:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:25,051 INFO L225 Difference]: With dead ends: 39960 [2025-03-08 05:30:25,051 INFO L226 Difference]: Without dead ends: 26831 [2025-03-08 05:30:25,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:25,073 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 48 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:25,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 406 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26831 states. [2025-03-08 05:30:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26831 to 26815. [2025-03-08 05:30:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26815 states, 26760 states have (on average 1.6429745889387144) internal successors, (43966), 26763 states have internal predecessors, (43966), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 05:30:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26815 states to 26815 states and 44035 transitions. [2025-03-08 05:30:25,703 INFO L78 Accepts]: Start accepts. Automaton has 26815 states and 44035 transitions. Word has length 93 [2025-03-08 05:30:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:25,703 INFO L471 AbstractCegarLoop]: Abstraction has 26815 states and 44035 transitions. [2025-03-08 05:30:25,704 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26815 states and 44035 transitions. [2025-03-08 05:30:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:30:25,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:25,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:25,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:30:25,732 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:25,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1568899151, now seen corresponding path program 1 times [2025-03-08 05:30:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481829895] [2025-03-08 05:30:25,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:25,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:30:25,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:30:25,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:25,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:30:25,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481829895] [2025-03-08 05:30:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481829895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:25,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:25,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295725442] [2025-03-08 05:30:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:25,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:25,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:25,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:25,792 INFO L87 Difference]: Start difference. First operand 26815 states and 44035 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:26,250 INFO L93 Difference]: Finished difference Result 75210 states and 123774 transitions. [2025-03-08 05:30:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:26,250 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2025-03-08 05:30:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:26,382 INFO L225 Difference]: With dead ends: 75210 [2025-03-08 05:30:26,382 INFO L226 Difference]: Without dead ends: 50344 [2025-03-08 05:30:26,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:26,419 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 46 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:26,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 406 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50344 states. [2025-03-08 05:30:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50344 to 50328. [2025-03-08 05:30:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50328 states, 50273 states have (on average 1.6199152626658444) internal successors, (81438), 50276 states have internal predecessors, (81438), 35 states have call successors, (35), 18 states have call predecessors, (35), 19 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 05:30:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50328 states to 50328 states and 81507 transitions. [2025-03-08 05:30:27,387 INFO L78 Accepts]: Start accepts. Automaton has 50328 states and 81507 transitions. Word has length 94 [2025-03-08 05:30:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:27,387 INFO L471 AbstractCegarLoop]: Abstraction has 50328 states and 81507 transitions. [2025-03-08 05:30:27,388 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:30:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 50328 states and 81507 transitions. [2025-03-08 05:30:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:30:27,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:27,423 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:27,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:30:27,423 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:27,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1429673525, now seen corresponding path program 1 times [2025-03-08 05:30:27,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:27,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72401917] [2025-03-08 05:30:27,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:27,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:30:27,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:30:27,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:27,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:30:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:27,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72401917] [2025-03-08 05:30:27,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72401917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:27,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984936035] [2025-03-08 05:30:27,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:27,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:27,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:27,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:27,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:30:27,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:30:27,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:30:27,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:27,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:27,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:30:27,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:30:27,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984936035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-08 05:30:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861068278] [2025-03-08 05:30:27,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:27,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:27,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:27,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:30:27,781 INFO L87 Difference]: Start difference. First operand 50328 states and 81507 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 05:30:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:28,265 INFO L93 Difference]: Finished difference Result 50328 states and 81507 transitions. [2025-03-08 05:30:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:28,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 95 [2025-03-08 05:30:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:28,272 INFO L225 Difference]: With dead ends: 50328 [2025-03-08 05:30:28,272 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:30:28,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:30:28,297 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:28,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:30:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:30:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:30:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:30:28,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2025-03-08 05:30:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:30:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 05:30:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:30:28,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:30:28,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:28,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:28,507 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:28,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.